<!DOCTYPE html><html lang="zh-CN" data-theme="light"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width, initial-scale=1.0,viewport-fit=cover"><title>Soft test | C·辰</title><meta name="author" content="辰"><meta name="copyright" content="辰"><meta name="format-detection" content="telephone=no"><meta name="theme-color" content="#ffffff"><meta name="description" content="Soft test">
<meta property="og:type" content="article">
<meta property="og:title" content="Soft test">
<meta property="og:url" content="http://example.com/2023/04/11/%E8%BD%AF%E8%80%83/index.html">
<meta property="og:site_name" content="C·辰">
<meta property="og:description" content="Soft test">
<meta property="og:locale" content="zh_CN">
<meta property="og:image" content="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog%2Fimages%2Fpage2.jpg">
<meta property="article:published_time" content="2023-04-11T03:11:11.000Z">
<meta property="article:modified_time" content="2023-05-26T16:13:52.904Z">
<meta property="article:author" content="辰">
<meta property="article:tag" content="Soft test">
<meta name="twitter:card" content="summary">
<meta name="twitter:image" content="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog%2Fimages%2Fpage2.jpg"><link rel="shortcut icon" href="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog/images/Bell.ico"><link rel="canonical" href="http://example.com/2023/04/11/%E8%BD%AF%E8%80%83/index.html"><link rel="preconnect" href="//cdn.jsdelivr.net"/><link rel="preconnect" href="//busuanzi.ibruce.info"/><link rel="stylesheet" href="/css/index.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fortawesome/fontawesome-free/css/all.min.css" media="print" onload="this.media='all'"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fancyapps/ui/dist/fancybox/fancybox.min.css" media="print" onload="this.media='all'"><script>const GLOBAL_CONFIG = { 
  root: '/',
  algolia: undefined,
  localSearch: {"path":"/search.xml","languages":{"hits_empty":"找不到您查询的内容：${query}","hits_stats":"共找到 ${hits} 篇文章"}},
  translate: undefined,
  noticeOutdate: undefined,
  highlight: {"plugin":"highlighjs","highlightCopy":true,"highlightLang":true,"highlightHeightLimit":false},
  copy: {
    success: '复制成功',
    error: '复制错误',
    noSupport: '浏览器不支持'
  },
  relativeDate: {
    homepage: false,
    post: false
  },
  runtime: '',
  dateSuffix: {
    just: '刚刚',
    min: '分钟前',
    hour: '小时前',
    day: '天前',
    month: '个月前'
  },
  copyright: undefined,
  lightbox: 'fancybox',
  Snackbar: undefined,
  source: {
    justifiedGallery: {
      js: 'https://cdn.jsdelivr.net/npm/flickr-justified-gallery/dist/fjGallery.min.js',
      css: 'https://cdn.jsdelivr.net/npm/flickr-justified-gallery/dist/fjGallery.min.css'
    }
  },
  isPhotoFigcaption: false,
  islazyload: true,
  isAnchor: false,
  percent: {
    toc: true,
    rightside: false,
  }
}</script><script id="config-diff">var GLOBAL_CONFIG_SITE = {
  title: 'Soft test',
  isPost: true,
  isHome: false,
  isHighlightShrink: false,
  isToc: true,
  postUpdate: '2023-05-27 00:13:52'
}</script><noscript><style type="text/css">
  #nav {
    opacity: 1
  }
  .justified-gallery img {
    opacity: 1
  }

  #recent-posts time,
  #post-meta time {
    display: inline !important
  }
</style></noscript><script>(win=>{
    win.saveToLocal = {
      set: function setWithExpiry(key, value, ttl) {
        if (ttl === 0) return
        const now = new Date()
        const expiryDay = ttl * 86400000
        const item = {
          value: value,
          expiry: now.getTime() + expiryDay,
        }
        localStorage.setItem(key, JSON.stringify(item))
      },

      get: function getWithExpiry(key) {
        const itemStr = localStorage.getItem(key)

        if (!itemStr) {
          return undefined
        }
        const item = JSON.parse(itemStr)
        const now = new Date()

        if (now.getTime() > item.expiry) {
          localStorage.removeItem(key)
          return undefined
        }
        return item.value
      }
    }
  
    win.getScript = url => new Promise((resolve, reject) => {
      const script = document.createElement('script')
      script.src = url
      script.async = true
      script.onerror = reject
      script.onload = script.onreadystatechange = function() {
        const loadState = this.readyState
        if (loadState && loadState !== 'loaded' && loadState !== 'complete') return
        script.onload = script.onreadystatechange = null
        resolve()
      }
      document.head.appendChild(script)
    })
  
    win.getCSS = (url,id = false) => new Promise((resolve, reject) => {
      const link = document.createElement('link')
      link.rel = 'stylesheet'
      link.href = url
      if (id) link.id = id
      link.onerror = reject
      link.onload = link.onreadystatechange = function() {
        const loadState = this.readyState
        if (loadState && loadState !== 'loaded' && loadState !== 'complete') return
        link.onload = link.onreadystatechange = null
        resolve()
      }
      document.head.appendChild(link)
    })
  
      win.activateDarkMode = function () {
        document.documentElement.setAttribute('data-theme', 'dark')
        if (document.querySelector('meta[name="theme-color"]') !== null) {
          document.querySelector('meta[name="theme-color"]').setAttribute('content', '#0d0d0d')
        }
      }
      win.activateLightMode = function () {
        document.documentElement.setAttribute('data-theme', 'light')
        if (document.querySelector('meta[name="theme-color"]') !== null) {
          document.querySelector('meta[name="theme-color"]').setAttribute('content', '#ffffff')
        }
      }
      const t = saveToLocal.get('theme')
    
          if (t === 'dark') activateDarkMode()
          else if (t === 'light') activateLightMode()
        
      const asideStatus = saveToLocal.get('aside-status')
      if (asideStatus !== undefined) {
        if (asideStatus === 'hide') {
          document.documentElement.classList.add('hide-aside')
        } else {
          document.documentElement.classList.remove('hide-aside')
        }
      }
    
    const detectApple = () => {
      if(/iPad|iPhone|iPod|Macintosh/.test(navigator.userAgent)){
        document.documentElement.classList.add('apple')
      }
    }
    detectApple()
    })(window)</script><meta name="generator" content="Hexo 6.3.0"></head><body><div id="sidebar"><div id="menu-mask"></div><div id="sidebar-menus"><div class="avatar-img is-center"><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog%2Fimages%2Favatar.jpg" onerror="onerror=null;src='/img/friend_404.gif'" alt="avatar"/></div><div class="sidebar-site-data site-data is-center"><a href="/archives/"><div class="headline">文章</div><div class="length-num">32</div></a><a href="/tags/"><div class="headline">标签</div><div class="length-num">28</div></a><a href="/categories/"><div class="headline">分类</div><div class="length-num">10</div></a></div><hr/><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 首页</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fa fa-archive"></i><span> 时间轴</span></a></div><div class="menus_item"><a class="site-page group" href="javascript:void(0);"><i class="fa-fw fa fa-graduation-cap"></i><span> 博文</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="/categories/"><i class="fa-fw fa fa-folder-open"></i><span> 分类</span></a></li><li><a class="site-page child" href="/tags/"><i class="fa-fw fa fa-tags"></i><span> 标签</span></a></li><li><a class="site-page child" href="/archives/"><i class="fa-fw fa fa-folder-open"></i><span> 归档</span></a></li></ul></div><div class="menus_item"><a class="site-page group" href="javascript:void(0);"><i class="fa-fw fas fa-list"></i><span> Demo</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="/c2c_shop/"><i class="fa-fw fa fa-comments-o"></i><span> 商城</span></a></li></ul></div></div></div></div><div class="post" id="body-wrap"><header class="post-bg" id="page-header" style="background-image: url('https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog%2Fimages%2Fpage2.jpg')"><nav id="nav"><span id="blog-info"><a href="/" title="C·辰"><span class="site-name">C·辰</span></a></span><div id="menus"><div id="search-button"><a class="site-page social-icon search" href="javascript:void(0);"><i class="fas fa-search fa-fw"></i><span> 搜索</span></a></div><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fas fa-home"></i><span> 首页</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fa fa-archive"></i><span> 时间轴</span></a></div><div class="menus_item"><a class="site-page group" href="javascript:void(0);"><i class="fa-fw fa fa-graduation-cap"></i><span> 博文</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="/categories/"><i class="fa-fw fa fa-folder-open"></i><span> 分类</span></a></li><li><a class="site-page child" href="/tags/"><i class="fa-fw fa fa-tags"></i><span> 标签</span></a></li><li><a class="site-page child" href="/archives/"><i class="fa-fw fa fa-folder-open"></i><span> 归档</span></a></li></ul></div><div class="menus_item"><a class="site-page group" href="javascript:void(0);"><i class="fa-fw fas fa-list"></i><span> Demo</span><i class="fas fa-chevron-down"></i></a><ul class="menus_item_child"><li><a class="site-page child" href="/c2c_shop/"><i class="fa-fw fa fa-comments-o"></i><span> 商城</span></a></li></ul></div></div><div id="toggle-menu"><a class="site-page" href="javascript:void(0);"><i class="fas fa-bars fa-fw"></i></a></div></div></nav><div id="post-info"><h1 class="post-title">Soft test</h1><div id="post-meta"><div class="meta-firstline"><span class="post-meta-date"><i class="far fa-calendar-alt fa-fw post-meta-icon"></i><span class="post-meta-label">发表于</span><time class="post-meta-date-created" datetime="2023-04-11T03:11:11.000Z" title="发表于 2023-04-11 11:11:11">2023-04-11</time><span class="post-meta-separator">|</span><i class="fas fa-history fa-fw post-meta-icon"></i><span class="post-meta-label">更新于</span><time class="post-meta-date-updated" datetime="2023-05-26T16:13:52.904Z" title="更新于 2023-05-27 00:13:52">2023-05-27</time></span><span class="post-meta-categories"><span class="post-meta-separator">|</span><i class="fas fa-inbox fa-fw post-meta-icon"></i><a class="post-meta-categories" href="/categories/Java/">Java</a></span></div><div class="meta-secondline"><span class="post-meta-separator">|</span><span class="post-meta-wordcount"><i class="far fa-file-word fa-fw post-meta-icon"></i><span class="post-meta-label">字数总计:</span><span class="word-count">9.1k</span><span class="post-meta-separator">|</span><i class="far fa-clock fa-fw post-meta-icon"></i><span class="post-meta-label">阅读时长:</span><span>30分钟</span></span><span class="post-meta-separator">|</span><span class="post-meta-pv-cv" id="" data-flag-title="Soft test"><i class="far fa-eye fa-fw post-meta-icon"></i><span class="post-meta-label">阅读量:</span><span id="busuanzi_value_page_pv"><i class="fa-solid fa-spinner fa-spin"></i></span></span></div></div></div></header><main class="layout" id="content-inner"><div id="post"><article class="post-content" id="article-container"><h1 id="计算机组成与体系结构"><a href="#计算机组成与体系结构" class="headerlink" title="计算机组成与体系结构"></a>计算机组成与体系结构</h1><h2 id="进制"><a href="#进制" class="headerlink" title="进制"></a>进制</h2><h3 id="①R进制转十进制"><a href="#①R进制转十进制" class="headerlink" title="①	R进制转十进制"></a>①	R进制转十进制</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322145127870.png" alt="image-20230322145127870"></p>
<p>​	R进制转为十进制，底数为R</p>
<h3 id="②-十进制转R进制-–-短除法"><a href="#②-十进制转R进制-–-短除法" class="headerlink" title="② 十进制转R进制 – 短除法"></a>② 十进制转R进制 – 短除法</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322150036855.png" alt="image-20230322150036855"></p>
<p>​	R为待转进制数</p>
<h3 id="③-二进制转八进制和十六进制"><a href="#③-二进制转八进制和十六进制" class="headerlink" title="③ 二进制转八进制和十六进制"></a>③ 二进制转八进制和十六进制</h3><p>​	（1）二进制转八进制，三位为一单位</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322150640826.png" alt="image-20230322150640826"></p>
<p>​	</p>
<p>​	（2）二进制转十六进制，四位为一单位，10开始使用A为一个数字为进行代表，A:10，B:11, C:12, D:13, E:14, F:15</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322150750112.png" alt="image-20230322150750112"></p>
<p>​	</p>
<p>​	</p>
<p>​		加法：</p>
<p>​		减法：</p>
<p>​		乘法：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324112607453.png" alt="image-20230324112607453"></p>
<p>​		</p>
<p>​		除法：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324113653670.png" alt="image-20230324113653670"></p>
<hr>
<h2 id="浮点数运算"><a href="#浮点数运算" class="headerlink" title="浮点数运算"></a>浮点数运算</h2><p>浮点数能表示的数的范围由阶码（e）的位数决定，精度由尾数的位数决定。</p>
<p>数符：正为0   负为1</p>
<p>阶符：在转换时候出现 n的正负 依然遵循 正0 负1 的规律  </p>
<p>阶码：次方数</p>
<p>尾数：小数点后的数</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230326194656210.png" alt="image-20230326194656210"></p>
<h2 id="编码"><a href="#编码" class="headerlink" title="编码"></a>编码</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322151910323.png" alt="image-20230322151910323"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322154312239.png" alt="image-20230322154312239"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230327170115875.png" alt="image-20230327170115875"></p>
<h3 id="①原码"><a href="#①原码" class="headerlink" title="①原码"></a>①原码</h3><p>​		转为二进制，不足8为补0，最高位为符号位。(1)-&gt;00000001    </p>
<p>​		1为负，0为正; 	(-1)-&gt;100000001	    (1-1)-&gt;(1+(-1))-&gt;100000010-&gt;-2</p>
<h3 id="②反码"><a href="#②反码" class="headerlink" title="②反码"></a>②反码</h3><p>​		正数和原码相同； 负数符号位不变其余取反，运算后除了符号位其余取反则位原码值															</p>
<p>​		正：(00000001)-&gt;(000000001)		负：(100000001)-&gt;(11111110)</p>
<p>​		（1-1）-&gt;(111111111)-&gt;(10000000)-&gt;-0</p>
<h3 id="③补码"><a href="#③补码" class="headerlink" title="③补码"></a>③补码</h3><p>​		正数&#x3D;&#x3D;反码&#x3D;&#x3D;原码</p>
<p>​		负数：&#x3D;&#x3D;  反码+1</p>
<p>​		</p>
<h3 id="④移码（浮点运算的接码）"><a href="#④移码（浮点运算的接码）" class="headerlink" title="④移码（浮点运算的接码）"></a>④移码（浮点运算的接码）</h3><p>​		移码&#x3D;&#x3D;补码的首位取反</p>
<p>​		</p>
<hr>
<h2 id="计算机结构"><a href="#计算机结构" class="headerlink" title="计算机结构"></a>计算机结构</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322155550576.png" alt="image-20230322155550576"></p>
<h3 id="CISC-与-RISC"><a href="#CISC-与-RISC" class="headerlink" title="CISC 与 RISC"></a>CISC 与 RISC</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230519155544313.png" alt="image-20230519155544313"></p>
<hr>
<h3 id="流水线"><a href="#流水线" class="headerlink" title="流水线"></a>流水线</h3><p>​		流水线是指在程序执行时多条指令重叠进行操作的一种准并行处理实现技术。各种部件同时处理是针对不同指令而言的，它们可同时为多条指令的不同部分进行工作，以提高各部件的利用率和指令的平均执行速度</p>
<h4 id="流水线周期、执行时间计算"><a href="#流水线周期、执行时间计算" class="headerlink" title="流水线周期、执行时间计算"></a>流水线周期、执行时间计算</h4><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322164946243.png" alt="image-20230322164946243"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322172213498.png" alt="image-20230322172213498"></p>
<p>​	解：	流水线周期：2ns				</p>
<p>​			   100条指令全部执行完毕需要的事件为：</p>
<p>​				①理论公式：（2+2+1）+（100-1）*2&#x3D;203</p>
<p>​				②实践公式：（3+100-1）*2&#x3D;204</p>
<h4 id="流水线吞吐量计算"><a href="#流水线吞吐量计算" class="headerlink" title="流水线吞吐量计算"></a>流水线吞吐量计算</h4><p>​	吞吐率 TP：单位时间内流水线所完成的任务数量或输出的结构数量</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322190451426.png" alt="image-20230322190451426"></p>
<hr>
<p>​	流水线最大吞吐率：1&#x2F;周期时间</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322190733287.png" alt="image-20230322190733287"></p>
<h4 id="流水线的加速比计算"><a href="#流水线的加速比计算" class="headerlink" title="流水线的加速比计算"></a>流水线的加速比计算</h4><p>​					<img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322191241488.png" alt="image-20230322191241488"></p>
<h4 id="流水线的效率计算"><a href="#流水线的效率计算" class="headerlink" title="流水线的效率计算"></a>流水线的效率计算</h4><h4 id="l"><a href="#l" class="headerlink" title="             l"></a><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322191345872.png" alt="image-20230322191345872">             l</h4><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322194042204.png" alt="image-20230322194042204"></p>
<h3 id="Cache-SRAM"><a href="#Cache-SRAM" class="headerlink" title="Cache:SRAM"></a>Cache:SRAM</h3><ul>
<li><p><strong>Cache与主存地址的映射是由电硬件自动完成</strong></p>
</li>
<li><p>冲突数小：<strong>全相联</strong>、组相联、直接</p>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322222752470.png" alt="image-20230322222752470"></p>
<p>​	</p>
<p>层次化存储结构</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322222831226.png" alt="image-20230322222831226"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230322222935258.png" alt="image-20230322222935258"></p>
<h2 id="中断-x2F-I-x2F-O"><a href="#中断-x2F-I-x2F-O" class="headerlink" title="中断  &#x2F;  I&#x2F;O"></a>中断  &#x2F;  I&#x2F;O</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230522213308092.png" alt="image-20230522213308092"></p>
<ul>
<li><strong>中断向量</strong>：提供中断服务程序的入口地址</li>
<li><strong>中断响应时间</strong>：发出中断请求开始进入中断服务程序</li>
<li>保存现场返回来执行源程序：<strong>堆栈</strong></li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230519232110948.png" alt="image-20230519232110948"></p>
<h1 id="存储器"><a href="#存储器" class="headerlink" title="存储器"></a>存储器</h1><ul>
<li><h2 id="CPU"><a href="#CPU" class="headerlink" title="CPU"></a>CPU</h2></li>
<li><p>虚拟存储器：主存+赋存</p>
</li>
<li><p>主存：DRAM</p>
</li>
<li><p><strong>按内容</strong>访问：相联存储器</p>
</li>
<li><p>按访问方式分类：内容、地址</p>
</li>
<li><p><strong>按寻址</strong>方式：随机RAM、顺序SAM、直接DRAM</p>
</li>
<li><p>EEPROM:电可擦除</p>
</li>
<li><p>空间局部性：访问邻接指令</p>
</li>
<li><p>时间局部性：再次被访问</p>
</li>
<li><p>闪存：块为单位，</p>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230519211038955.png" alt="image-20230519211038955"></p>
<h4 id="随机存取存储器"><a href="#随机存取存储器" class="headerlink" title="随机存取存储器"></a>随机存取存储器</h4><p>①DRAM	(Dynamic RAM,动态RAM) - SDRAM</p>
<p>②SRAM	(Static RAM,静态)</p>
<h4 id="只读存储器"><a href="#只读存储器" class="headerlink" title="只读存储器"></a>只读存储器</h4><p>①MROM	(Mask ROM,	掩护式ROM)</p>
<p>②PROM	(Programmable ROM,	一次可编程ROM)</p>
<p>③EROM	(Erasable PROM,	可擦除的PROM)</p>
<p>④闪速存储器	(flash memory,	闪存)</p>
<h4 id="编址"><a href="#编址" class="headerlink" title="编址"></a>编址</h4><p>*地址单元&#x3D;大内存地址-小内存地址+1</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324232208904.png" alt="image-20230324232208904"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324210848107.png" alt="image-20230324210848107">                            </p>
<h3 id="磁盘"><a href="#磁盘" class="headerlink" title="磁盘"></a>磁盘</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230323223902279.png" alt="image-20230323223902279"></p>
<p>例题：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230323225828855.png" alt="image-20230323225828855"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230323230159303.png" alt="image-20230323230159303"></p>
<h3 id="总线"><a href="#总线" class="headerlink" title="总线"></a>总线</h3><ul>
<li><p>系统总线：ISA、EISA、PCI:并行<strong>内</strong>总线</p>
</li>
<li><p>SCSI::并行<strong>外</strong>总线</p>
</li>
<li><p>减少信息传输线的数量</p>
</li>
<li><p>带宽&#x3D;时钟频率*B字节</p>
</li>
</ul>
<p>（1）内部总线</p>
<p>（2）系统总线</p>
<p>​		①数据总线	②地址总线	③控制总线</p>
<p>（3）外部总线</p>
<h3 id="系统可靠性分析"><a href="#系统可靠性分析" class="headerlink" title="系统可靠性分析"></a>系统可靠性分析</h3><p>考察：计算</p>
<p>例题：串联中存在并联，串联位为主体</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324234143873.png" alt="image-20230324234143873"></p>
<hr>
<h4 id="串联系统"><a href="#串联系统" class="headerlink" title="串联系统"></a>串联系统</h4><p>​		可靠度：R&#x3D;R1xR2xR3xR4xR5x…xRn</p>
<p>​		失效率：λ&#x3D;λ1+λ2+λ3+λ4+λ5+…+λn</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324232004292.png" alt="image-20230324232004292"></p>
<hr>
<h4 id="并联系统"><a href="#并联系统" class="headerlink" title="并联系统"></a>并联系统</h4><p>​		可靠度（1-失效率）：R&#x3D;1-(1-R1)x(1-R2)x(1-R3)x(1-R4)x(1-R5)x…x(1-Rn)</p>
<p>​		失效率：1-可靠度</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324233124280.png" alt="image-20230324233124280"></p>
<hr>
<h4 id="n模冗余系统"><a href="#n模冗余系统" class="headerlink" title="n模冗余系统"></a>n模冗余系统</h4><p>（少考）</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324233824473.png" alt="image-20230324233824473"></p>
<hr>
<h3 id="差错控制"><a href="#差错控制" class="headerlink" title="差错控制"></a>差错控制</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230324235804309.png" alt="image-20230324235804309"></p>
<h4 id="CRC循环校验码–只能检错"><a href="#CRC循环校验码–只能检错" class="headerlink" title="CRC循环校验码–只能检错"></a>CRC循环校验码–只能检错</h4><p>模2除法（异或操作 ）–双1为0，1-0为1，0-1为1，补0为被除数-1位</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230325002415876.png" alt="image-20230325002415876"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230325002520222.png" alt="image-20230325002519540"></p>
<h4 id="奇偶校验"><a href="#奇偶校验" class="headerlink" title="奇偶校验"></a>奇偶校验</h4><p>码距d：两个二进制比较多少位不同</p>
<h4 id="海明校验码"><a href="#海明校验码" class="headerlink" title="海明校验码"></a>海明校验码</h4><ul>
<li>利用奇偶校验纠错</li>
<li>码距&gt;1,&#x3D;2可以检错，&gt;&#x3D;3可以纠错</li>
</ul>
<p>（1）确定校验位为多少位(r)，&gt;&#x3D;n+r+1</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230326004248656.png" alt="image-20230326004248656"></p>
<p>（2）校验码放的位置为2的次方</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230326004355944.png" alt="image-20230326004355944"></p>
<p>例题：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230326004446123.png" alt="image-20230326004446123"></p>
<hr>
<h1 id="操作系统"><a href="#操作系统" class="headerlink" title="操作系统"></a>操作系统</h1><h2 id="进程管理"><a href="#进程管理" class="headerlink" title="进程管理"></a>进程管理</h2><h3 id="进程的状态"><a href="#进程的状态" class="headerlink" title="进程的状态"></a>进程的状态</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/%E8%BF%9B%E7%A8%8B%E7%AE%A1%E7%90%86.png" alt="image-20230329142047570"></p>
<hr>
<h3 id="前趋图"><a href="#前趋图" class="headerlink" title="前趋图"></a>前趋图</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329143056830.png" alt="image-20230329143056830"></p>
<hr>
<h3 id="PV操作"><a href="#PV操作" class="headerlink" title="PV操作"></a>PV操作</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329151040384.png" alt="image-20230329151040384"></p>
<p>p操作&#x3D;&#x3D;自-1			</p>
<p>​			当判断为True时被阻塞放入到进程队列等待</p>
<p>​			当判断为False时则继续进行下去</p>
<p>v操作&#x3D;&#x3D;自+1</p>
<p>​			当判断为True时被阻塞放入到进程队列等待</p>
<p>​			当判断为False时则继续进行下去</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329153254055.png" alt="image-20230329153254055"></p>
<hr>
<p>习题</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329164111459.png" alt="image-20230329164111459"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329164129339.png" alt="image-20230329164129339"></p>
<p>C	A	A</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329164156294.png" alt="image-20230329164156294"></p>
<hr>
<h3 id="死锁问题"><a href="#死锁问题" class="headerlink" title="死锁问题"></a>死锁问题</h3><p>至少资源计算：（n(需求)-1）x k(进程数)+1</p>
<p>死锁的预防：打破四大条件：</p>
<p>​						互斥、保持和等待、不剥夺、环路等待  </p>
<p>死锁的避免：有序资源分配法、银行家算法</p>
<hr>
<h2 id="存储管理"><a href="#存储管理" class="headerlink" title="存储管理"></a>存储管理</h2><h3 id="分区存储组织"><a href="#分区存储组织" class="headerlink" title="分区存储组织"></a>分区存储组织</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329185415029.png" alt="image-20230329185415029"></p>
<hr>
<h3 id="页式存储组织"><a href="#页式存储组织" class="headerlink" title="页式存储组织"></a>页式存储组织</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329234456158.png" alt="image-20230329234456158"></p>
<blockquote>
<p>练习：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230329235523601.png" alt="image-20230329235523601">s</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230330001023816.png" alt="image-20230330001023816"></p>
</blockquote>
<hr>
<h3 id="段式存储组织（逻辑结构划分）"><a href="#段式存储组织（逻辑结构划分）" class="headerlink" title="段式存储组织（逻辑结构划分）"></a>段式存储组织（逻辑结构划分）</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230331233316182.png" alt="image-20230331233316182">7</p>
<hr>
<h3 id="段页存储组织"><a href="#段页存储组织" class="headerlink" title="段页存储组织"></a>段页存储组织</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230331233651221.png" alt="image-20230331233651221"></p>
<hr>
<h3 id="快表"><a href="#快表" class="headerlink" title="快表"></a>快表</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230331233758309.png" alt="image-20230331233758309"></p>
<hr>
<h3 id="页面置换算法"><a href="#页面置换算法" class="headerlink" title="页面置换算法"></a>页面置换算法</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230331233928223.png" alt="image-20230331233928223"></p>
<blockquote>
<p>例题：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419113435281.png" alt="image-20230419113435281"></p>
<p>（1）：没有使用快表：说明每读一次程序的块，需要先在<strong>内存上查表</strong>，才能<strong>读取</strong>相应的内存块，所以每一个块需要两次内存的访问，总共6个块&#x3D;&#x3D;12</p>
<p>(2):规定：指令一次性读入，指令产生<strong>一次</strong>缺页中断。操作数产生<strong>两次</strong></p>
</blockquote>
<hr>
<h2 id="文件管理"><a href="#文件管理" class="headerlink" title="文件管理"></a>文件管理</h2><h3 id="索引文件结构"><a href="#索引文件结构" class="headerlink" title="索引文件结构"></a>索引文件结构</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419141510106.png" alt="image-20230419141510106"></p>
<p>① 0~9地址为直接索引，对应物理盘块，存取索引文件内容</p>
<p>② 一级间接索引：10 节点：存储物理盘块地址（假设一个地址4字节，一个索引节点假设4k，则可以存4k&#x2F;4bite*物理盘块4k ）</p>
<p>③ 二级间接索引：11节点，一级*1024</p>
<blockquote>
<p>例题</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419142226130.png" alt="image-20230419142226130"></p>
<p>解：58和187、二级地址索引表</p>
<p>① 58和187： 逻辑号从0开始算，第5块位于i-addr[5]中的58号，索引块为1k，一个地址项4B，一个索引块有1024&#x2F;4&#x3D;256个地址项（5~260），第261号刚好位于第187号索引位；</p>
<p>②  二级地址索引表</p>
</blockquote>
<h3 id="文件和树型目录结构"><a href="#文件和树型目录结构" class="headerlink" title="文件和树型目录结构"></a>文件和树型目录结构</h3><blockquote>
<p><strong>考点</strong>：绝对路径、相对路径</p>
</blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419143752558.png" alt="image-20230419143752558"></p>
<h3 id="空闲存储空间的管理"><a href="#空闲存储空间的管理" class="headerlink" title="空闲存储空间的管理"></a>空闲存储空间的管理</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419144414316.png" alt="image-20230419144414316"></p>
<blockquote>
<p>例题：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419145117874.png" alt="image-20230419145117874"></p>
<p>解： 132  ，    该子的第3个位置”1“</p>
<p>① 因为从0开始编位，从<strong>1位开始算</strong>，4195号位于4196，系统字节长32位，所以4195位于：（4195+1）&#x2F;32&#x3D;131.125</p>
<p>② 从<strong>0位开始算</strong>，</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419154443455.png" alt="image-20230419154443455"></p>
</blockquote>
<hr>
<h3 id="数据传输控制方式"><a href="#数据传输控制方式" class="headerlink" title="数据传输控制方式"></a>数据传输控制方式</h3><p> <img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419155007301.png" alt="image-20230419155007301"></p>
<hr>
<h3 id="虚设备与SPOOLING技术"><a href="#虚设备与SPOOLING技术" class="headerlink" title="虚设备与SPOOLING技术"></a>虚设备与SPOOLING技术</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419155549536.png" alt="image-20230419155549536"></p>
<hr>
<h3 id="微内核操作系统"><a href="#微内核操作系统" class="headerlink" title="微内核操作系统"></a>微内核操作系统</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419155843051.png" alt="image-20230419155843051"></p>
<hr>
<h1 id="数据库系统"><a href="#数据库系统" class="headerlink" title="数据库系统"></a>数据库系统</h1><h2 id="三级模式"><a href="#三级模式" class="headerlink" title="三级模式"></a>三级模式</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419160815883.png" alt="image-20230419160815883"></p>
<blockquote>
<p>外模式-概念模式映射：表发生变化，改映射不需要改程序</p>
<p><strong>外模式</strong>：比如数据库里面的<strong>视图</strong>，对数据库的数据处理</p>
<p><strong>模式</strong>：如数据库的<strong>基本表</strong></p>
<p>概念模式：比如数据库表的级别，把数据分成若干表</p>
<p>概念模式-内模式映射：内部存储形式和表的情况的映射关系</p>
<p><strong>内模式</strong>：管理如何存储数据（格式、优化），<strong>存储文件</strong></p>
<p>内模式层次  –&gt;  物理级数据库层次</p>
<p>概念层次  –&gt;  概念级数据库</p>
<p>用户应用程序层次  –&gt;  用户级数据库  </p>
</blockquote>
<h2 id="两级映射"><a href="#两级映射" class="headerlink" title="两级映射"></a>两级映射</h2><p>概念模式&#x3D;&#x3D;模式</p>
<ul>
<li>数据的<strong>物理独立性</strong>：修改<strong>模式和内模式</strong>之间的映像</li>
<li>数据的<strong>逻辑独立性</strong>：修改<strong>外模式和模式</strong>之间的映像</li>
</ul>
<h2 id="完整性"><a href="#完整性" class="headerlink" title="完整性"></a>完整性</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230523214636710.png" alt="image-20230523214636710"></p>
<hr>
<h2 id="数据库设计过程"><a href="#数据库设计过程" class="headerlink" title="数据库设计过程"></a>数据库设计过程</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419162622952.png" alt="image-20230419162622952"></p>
<hr>
<h2 id="E-R模型"><a href="#E-R模型" class="headerlink" title="E-R模型"></a>E-R模型</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419162731859.png" alt="image-20230419162731859"></p>
<blockquote>
<p>矩形 – 实体</p>
<p>椭圆 – 属性</p>
<p>菱形 – 联系</p>
</blockquote>
<p>制图方法：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419163129558.png" alt="image-20230419163129558"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419171329699.png" alt="image-20230419171329699"></p>
<blockquote>
<p>转成关系模式：一个实体转为一个模式，一个联系转为一个模式</p>
<p>① 1：1 –&gt;  可以把联系合并到其中的一个实体看成一个模式也可以单独转为一个模式，则最少可以转为2个关系模式。</p>
<p>② 1：n –&gt;    看情况把联系合并到哪个实体，最少可以转换为2个关系模式。</p>
<p>③ m:n  –&gt; 最少3个关系模式</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419171544228.png" alt="image-20230419171544228"></p>
</blockquote>
<hr>
<h2 id="关系代数"><a href="#关系代数" class="headerlink" title="关系代数"></a>关系代数</h2><blockquote>
<p>考点：关系代数表达式，找出等价表达式。写出关系代数表达式</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419171716549.png" alt="image-20230419171716549"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230523214947195.png" alt="image-20230523214947195"></p>
</blockquote>
<p>差集：A-B（A有且B没用）</p>
<p>笛卡尔积：A x B （A中一个个乘与B全部）</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419192710789.png" alt="image-20230419192710789"></p>
<p><strong>投影</strong>：列与列</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230523215803663.png" alt="image-20230523215803663"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230523215722509.png"></p>
<p><strong>选择</strong>：行与行（如下标位为数字，则为列的数据）</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230523215821021.png" alt="image-20230523215821021"></p>
<p><strong>连接</strong>：相同字段连接，自然连接起来，相同字段被去除，当需要计算投影，要算入相同字段，如例题则为  Sno、Sname、Sdept、Sno、Sage</p>
<p>元组：两个表的属性要相等</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419193348343.png" alt="image-20230419193348343"></p>
<p>​	</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230524000708127.png"></p>
<ul>
<li><p>左连接：左表保留全部属性，就算右表不存在连接则显示null</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230524004523552.png" alt="image-20230524004523552"></p>
</li>
<li><p>右连接：右表保留全部属性，就算左表不存在连接则显示null</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230524004608661.png" alt="image-20230524004608661"></p>
</li>
</ul>
<hr>
<h2 id="规范化理论"><a href="#规范化理论" class="headerlink" title="规范化理论"></a>规范化理论</h2><h3 id="函数依赖"><a href="#函数依赖" class="headerlink" title="函数依赖"></a>函数依赖</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230421205843919.png" alt="image-20230421205843919"></p>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230421211022364.png" alt="image-20230421211022364"></p>
<p><strong>部分函数依赖：</strong></p>
<p>主键是两个属性的组合键，主键其中的一部分可以确定某一个属性</p>
</blockquote>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230421211007764.png" alt="image-20230421211007764"></p>
<p><strong>传递函数依赖</strong>：</p>
<p>A确定B，B能确定C，则A可以确定C</p>
</blockquote>
<h3 id="价值与用途"><a href="#价值与用途" class="headerlink" title="价值与用途"></a>价值与用途</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230421211226284.png" alt="image-20230421211226284"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230523213943232.png" alt="image-20230523213943232"></p>
<h3 id="键"><a href="#键" class="headerlink" title="键"></a>键</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230421211838927.png" alt="image-20230421211838927"></p>
<blockquote>
<p><strong>超键</strong> ：唯一标识元组，可能存在冗余属性（例如学号和姓名可以确定性别，学号和姓名为超键）</p>
<p><strong>候选键</strong> ： 无冗余属性，候选键可以有多个，主键只有一个</p>
<p><strong>入度</strong>：被指向，指入</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423164355482.png" alt="image-20230423164355482"></p>
</blockquote>
<blockquote>
<p>例题1 ：<strong>求候选关键字</strong>  A1</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423165522410.png" alt="image-20230423165522410"></p>
<p>解：只有A1入度为0且以A1为起点，可以遍历所有的结点</p>
</blockquote>
<blockquote>
<p>例题2 ：<strong>求候选码</strong>  ABCD</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423165706226.png" alt="image-20230423165706226"></p>
<p>解：</p>
<p>注意事项：（ABD-&gt;E   是A与B与D汇合才能指向E，不能一个就使用单指向箭头）</p>
<p>错误画法：<img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423165947453.png" alt="image-20230423165947453"></p>
<p>该题的答案为：<strong>ABCD组合键才是候选码</strong> ： </p>
</blockquote>
<blockquote>
<p>例题3 ： 组合键为A和B（如果写：AB则为一个组合键）</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423170334018.png" alt="image-20230423170334018"></p>
<p>解答：没用入度为0，找中间结点（有出度和入度），</p>
</blockquote>
<h3 id="范式"><a href="#范式" class="headerlink" title="范式"></a>范式</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423171144700.png" alt="image-20230423171144700"></p>
<h4 id="第一范式（1NF）"><a href="#第一范式（1NF）" class="headerlink" title="第一范式（1NF）"></a>第一范式（1NF）</h4><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423171903839.png" alt="image-20230423171903839"></p>
<blockquote>
<p>例题：第一范式：就是等价头目录，没有分类下去–父类</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423172012055.png" alt="image-20230423172012055"></p>
</blockquote>
<h4 id="第二范式（2NF）"><a href="#第二范式（2NF）" class="headerlink" title="第二范式（2NF）"></a>第二范式（2NF）</h4><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423172608028.png" alt="image-20230423172608028"></p>
<p>部分依赖：主键为组合键</p>
<blockquote>
<p>思考题：</p>
<p>数据冗余：CREADIT字段</p>
<p>更新异常：更新CNO的CREDIT字段，必要要全部更新</p>
<p>插入异常：实现插入CNO+CREDIT，但没有SNO+GRADE数据</p>
<p>删除异常：删除一条信息，CREDIT也会被删除</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423172921413.png" alt="image-20230423172921413"></p>
<p>解决方案：把CNO和CREDIT提取出成一张新的表，原表删除CREDIT字段</p>
</blockquote>
<h4 id="第三范式（3NF）"><a href="#第三范式（3NF）" class="headerlink" title="第三范式（3NF）"></a>第三范式（3NF）</h4><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423192534075.png" alt="image-20230423192534075"></p>
<h4 id="BC范式"><a href="#BC范式" class="headerlink" title="BC范式"></a>BC范式</h4><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423202222826.png" alt="image-20230423202222826"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423202514711.png" alt="image-20230423202514711"></p>
<p>T不是候选键-&gt;不是bc范式</p>
<blockquote>
<p>例题</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230423204130361.png" alt="image-20230423204130361"></p>
<p>(1)  C  成为第三范式要实现 消除传递函数依赖，题意为不属于第三范式</p>
<p>(2) D   在多数据的表插入另一个字段</p>
<p>(3)  A    b:产生冗余数据–商品每次</p>
</blockquote>
<h3 id="模式分解"><a href="#模式分解" class="headerlink" title="模式分解"></a>模式分解</h3><ul>
<li>保持函数依赖分解</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230425164735401.png" alt="image-20230425164735401"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426135119224.png" alt="image-20230426135119224"></p>
<blockquote>
<p>分解后仍然保持函数依赖</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230425164901377.png" alt="image-20230425164901377"></p>
</blockquote>
<blockquote>
<p>例题1</p>
<p>原始表：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230425171533909.png" alt="image-20230425171533909"></p>
<p>解：第一列（成绩、学生、课程）为待分解出来的表</p>
<p>​		a : 每一行的a代表这个表拥有这个字段，下标为原表的第几列</p>
<p>​		b : 不拥有这个属性使用b，下标为：第几行第几列</p>
<p>根据依赖关系，把表还原</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426134929972.png" alt="image-20230426134929972"></p>
</blockquote>
<blockquote>
<p>例题2  –  判断是不是无损分解  – 一分为二</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426135212379.png" alt="image-20230426135212379"></p>
<p>解：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426135513375.png" alt="image-20230426135513375"></p>
<ul>
<li>R1-R2&#x3D;B 、R2-R1&#x3D;C</li>
</ul>
<p>​     集合的减相当于被减数减去和减数里面相同的部分，留下不同的则为答案</p>
<p>在原来函数集合中满足  （交集）A 确定（R1-R2) B 或者 （交集） A 确定（R2-R1)  C  则属于无损分解</p>
</blockquote>
<h3 id="并发控制"><a href="#并发控制" class="headerlink" title="并发控制"></a>并发控制</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426142933020.png" alt="image-20230426142933020"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426142952857.png" alt="image-20230426142952857"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426143006653.png" alt="image-20230426143006653"></p>
<h3 id="完整性约束"><a href="#完整性约束" class="headerlink" title="完整性约束"></a>完整性约束</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426144229456.png" alt="image-20230426144229456"></p>
<h3 id="数据库安全"><a href="#数据库安全" class="headerlink" title="数据库安全"></a>数据库安全</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426144524495.png" alt="image-20230426144524495"></p>
<h3 id="数据备份"><a href="#数据备份" class="headerlink" title="数据备份"></a>数据备份</h3><ul>
<li>冷备份\热备份</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426151742988.png" alt="image-20230426151742988"></p>
<ul>
<li>完全备份 \ 差量备份 \ 增量备份</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426151901432.png" alt="image-20230426151901432"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426152609783.png" alt="image-20230426152609783"></p>
<ul>
<li>故障与恢复</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426153743076.png" alt="image-20230426153743076"></p>
<h3 id="数据仓库与数据挖掘"><a href="#数据仓库与数据挖掘" class="headerlink" title="数据仓库与数据挖掘"></a>数据仓库与数据挖掘</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426154916334.png" alt="image-20230426154916334"></p>
<p>父分类：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426155108923.png" alt="image-20230426155108923"></p>
<h2 id="反规范化"><a href="#反规范化" class="headerlink" title="反规范化"></a>反规范化</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426155327878.png" alt="image-20230426155327878"></p>
<h3 id="大数据"><a href="#大数据" class="headerlink" title="大数据"></a>大数据</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426160249824.png" alt="image-20230426160249824"></p>
<hr>
<h1 id="计算机网络"><a href="#计算机网络" class="headerlink" title="计算机网络"></a>计算机网络</h1><h2 id="OSI-x2F-RM七层模型"><a href="#OSI-x2F-RM七层模型" class="headerlink" title="OSI&#x2F;RM七层模型"></a>OSI&#x2F;RM七层模型</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426160531360.png" alt="image-20230426160531360"></p>
<blockquote>
<p>习题1：局域网工作在底下两层，广播存在局域网</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426161724174.png" alt="image-20230426161724174"></p>
<p>解：求同一局域网</p>
<p>A ：通过网桥连接，属于同一局域网</p>
<p>B ：隔了路由器。路由器为第三层设备，不能透过通信</p>
<p>C ：隔了集线器，属于第一层设备</p>
<p>D ：隔了交换机，属于第二层设备</p>
</blockquote>
<hr>
<h2 id="网络技术标准与协议"><a href="#网络技术标准与协议" class="headerlink" title="网络技术标准与协议"></a>网络技术标准与协议</h2><blockquote>
<p><strong>FTP</strong> : 可靠 	<strong>TFTP</strong>:不可靠</p>
<p><strong>SNMP</strong> ： 简单网络管理协议</p>
<p><strong>文件共享协议</strong> (可通过UDP、TCP实现)：Samba(可跨平台)、CIFS、NFS</p>
</blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426162623475.png" alt="image-20230426162623475"></p>
<h3 id="TCP协议"><a href="#TCP协议" class="headerlink" title="TCP协议"></a>TCP协议</h3><ul>
<li>三次握手</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426164455819.png" alt="image-20230426164455819"></p>
<h3 id="DHCP协议"><a href="#DHCP协议" class="headerlink" title="DHCP协议"></a>DHCP协议</h3><ul>
<li>IP地址动态分配</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426164754578.png" alt="image-20230426164754578"></p>
<blockquote>
<p>6.为假地址（没有和DHCP服务器联系上）</p>
</blockquote>
<h3 id="DNS协议"><a href="#DNS协议" class="headerlink" title="DNS协议"></a>DNS协议</h3><blockquote>
<p>迭代查询：服务器必须回答目标IP与域名的映射关系。</p>
<p>递归查询：服务器收到一次迭代查询回复一次结果，这个结果不一定是目标IP与域名的映射关系，也可以是其他DNS服务器的地址</p>
</blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426172642267.png" alt="image-20230426172642267"></p>
<blockquote>
<p>例题</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426174131936.png" alt="image-20230426174131936"></p>
<p>根域名服务器直接反馈结果–&gt;迭代</p>
<p>中介服务器去问其他服务器，得到结果才反馈 –&gt; 递归</p>
</blockquote>
<h2 id="拓扑结构"><a href="#拓扑结构" class="headerlink" title="拓扑结构"></a>拓扑结构</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426174613773.png" alt="image-20230426174613773"></p>
<h2 id="网络规划与设计"><a href="#网络规划与设计" class="headerlink" title="网络规划与设计"></a>网络规划与设计</h2><blockquote>
<p>考点：了解规划和设计原则、逻辑设计和物理设计干什么</p>
</blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426175138166.png" alt="image-20230426175138166"></p>
<h3 id="逻辑网络设计"><a href="#逻辑网络设计" class="headerlink" title="逻辑网络设计"></a>逻辑网络设计</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426175643855.png" alt="image-20230426175643855"></p>
<h3 id="物理网络设计"><a href="#物理网络设计" class="headerlink" title="物理网络设计"></a>物理网络设计</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426175711091.png" alt="image-20230426175711091"></p>
<h3 id="分层设计"><a href="#分层设计" class="headerlink" title="分层设计"></a>分层设计</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426175728039.png" alt="image-20230426175728039"></p>
<h2 id="IP地址"><a href="#IP地址" class="headerlink" title="IP地址"></a>IP地址</h2><ul>
<li><p><strong>主机号全0为网络地址</strong> ，<strong>全1为广播地址</strong> ，计算主机数量要减去</p>
</li>
<li><p>A类 – 规定第一段首位为0</p>
<ul>
<li><p>前一段为网络号，后三段为主机号</p>
</li>
<li><p>主机数量：2^24 - 2</p>
</li>
</ul>
</li>
<li><p>B类  – 第一段第二位为0</p>
<ul>
<li>前两段为网络号，后两段为主机号</li>
<li>主机数量：2^16 - 2</li>
</ul>
</li>
<li><p>C类 – 第一段第三位为0</p>
<ul>
<li>前三段为网络地址，后一段为主机地址</li>
<li>主机数量：2^8 - 2</li>
</ul>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426201940349.png" alt="image-20230426201940349"></p>
<h2 id="子网划分"><a href="#子网划分" class="headerlink" title="子网划分"></a>子网划分</h2><h2 id="子网掩码"><a href="#子网掩码" class="headerlink" title="子网掩码"></a>子网掩码</h2><ul>
<li><p>子网掩码 &#x3D; 网络号 + 子网号 + 主机号</p>
</li>
<li><p><strong>网络号</strong>的部分为 <strong>1</strong>，<strong>子网号</strong>的部分为 <strong>1</strong>，<strong>主机号</strong> 为<strong>0</strong></p>
</li>
<li><p>求子网号 ：2^k&#x3D;N</p>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426205956929.png" alt="image-20230426205956929"></p>
<p>解：B类前16位为网络地址，在子网号中，因为 <strong>27个子网（N）</strong> 要取 <strong>5位做子网号（k）</strong> （2^5&#x3D;32&gt;27）,取5位位子，<strong>网络地址和子网号都为1</strong> 转为十进制即可求得子网掩码</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426210248681.png" alt="image-20230426210248681"></p>
<p>解：因为要求每个子网要有主机700台，即 2^k - 2 &gt;&#x3D; 700,k&#x3D;10,则<strong>主机位为10位</strong>，该IP地址为B类，后16位为主机号，现在<strong>主机位为10位</strong>，则主机号<strong>前6位为子网号</strong>，则 <strong>网络号和子网号为1，主机号为0 &#x3D;&#x3D; 子网掩码</strong></p>
</blockquote>
</li>
</ul>
<h2 id="无分类编址"><a href="#无分类编址" class="headerlink" title="无分类编址"></a>无分类编址</h2><blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426203905992.png" alt="image-20230426203905992"></p>
<p>解：</p>
<p><strong>172</strong> 网络号位于<strong>B类</strong>（128~191），**&#x2F;24** 表示：该IP地址转为二进制后，前24bite位为<strong>网络号</strong> ，后8bite位为<strong>主机号</strong>，主机数为：2^8 - 2 &#x3D; 254台</p>
</blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426211340356.png" alt="image-20230426211340356"></p>
<blockquote>
<p>例题</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426211523547.png" alt="image-20230426211523547"></p>
<p>解：</p>
<p>因为这是C类IP地址，所以前24bite位为网络号，8个bite位为主机号，</p>
<p>题目给出的地址块，前20位为网络号，后12位为主机号，不满足C类，所以<strong>主机号</strong>要<strong>让出4位做子网号</strong>，则<strong>子网数量 &#x3D; 2^4 &#x3D; 16 个C类子网</strong></p>
</blockquote>
<h2 id="特殊含义的IP地址"><a href="#特殊含义的IP地址" class="headerlink" title="特殊含义的IP地址"></a>特殊含义的IP地址</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426212032795.png" alt="image-20230426212032795"></p>
<h2 id="无线网"><a href="#无线网" class="headerlink" title="无线网"></a>无线网</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426235106719.png" alt="image-20230426235106719"></p>
<h2 id="网络接入技术"><a href="#网络接入技术" class="headerlink" title="网络接入技术"></a>网络接入技术</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230426235323038.png" alt="image-20230426235323038"></p>
<h2 id="IPV6"><a href="#IPV6" class="headerlink" title="IPV6"></a>IPV6</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230427000549366.png" alt="image-20230427000549366"></p>
<hr>
<h1 id="系统安全分析与设计"><a href="#系统安全分析与设计" class="headerlink" title="系统安全分析与设计"></a>系统安全分析与设计</h1><h2 id="信息系统安全属性"><a href="#信息系统安全属性" class="headerlink" title="信息系统安全属性"></a>信息系统安全属性</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505145251743.png" alt="image-20230505145251743"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230526003825953.png" alt="image-20230526003825953"></p>
<h2 id="对此加密技术"><a href="#对此加密技术" class="headerlink" title="对此加密技术"></a>对此加密技术</h2><ul>
<li>对此加密：加密密钥和解密密钥相同</li>
<li>大数据量</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505150334304.png" alt="image-20230505150334304"></p>
<h2 id="非对称加密技术"><a href="#非对称加密技术" class="headerlink" title="非对称加密技术"></a>非对称加密技术</h2><ul>
<li>使用甲公钥加密，甲公钥公开，需要使用甲私钥解</li>
<li>甲私钥加密（<strong>数字签名</strong>），由于甲公钥公开，所以谁都可以解开，但只有甲自己有私钥，所以定位是甲发出来的</li>
<li>不适合大数据量加密</li>
<li>拿对方公钥加密发送密文</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505150153442.png" alt="image-20230505150153442"></p>
<h2 id="信息摘要"><a href="#信息摘要" class="headerlink" title="信息摘要"></a>信息摘要</h2><p>防止篡改</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505151900265.png" alt="image-20230505151900265"></p>
<h2 id="数字签名"><a href="#数字签名" class="headerlink" title="数字签名"></a>数字签名</h2><p>签名-私钥</p>
<p>验证–公钥 </p>
<p>不可否认</p>
<ul>
<li><strong>A私钥加密（****数字签名</strong>），<strong>A公钥解</strong>，由于A公钥公开，所以谁都可以解开，但只有A自己有私钥，用公钥验证，所以定位是A发出来的（识别身份作用），无保密职能</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505152910069.png" alt="image-20230505152910069"></p>
<h2 id="数字信封与PGP"><a href="#数字信封与PGP" class="headerlink" title="数字信封与PGP"></a>数字信封与PGP</h2><ul>
<li>发送对称密钥</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505153640541.png" alt="image-20230505153640541"></p>
<h2 id="练习题-设计邮件加密系统"><a href="#练习题-设计邮件加密系统" class="headerlink" title="练习题  -  设计邮件加密系统"></a>练习题  -  设计邮件加密系统</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505154958334.png" alt="image-20230505154958334"></p>
<blockquote>
<p>解：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505155248472.png" alt="image-20230505155248472"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505155743142.png" alt="image-20230505155743142"></p>
</blockquote>
<h2 id="加密算法"><a href="#加密算法" class="headerlink" title="加密算法"></a>加密算法</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230520011216639.png" alt="image-20230520011216639"></p>
<ul>
<li>MD5  输入512  生成128</li>
<li>AES 分组加密</li>
</ul>
<h2 id="网络安全-–-各个网络层次的安全保障"><a href="#网络安全-–-各个网络层次的安全保障" class="headerlink" title="网络安全  –  各个网络层次的安全保障"></a>网络安全  –  各个网络层次的安全保障</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505160930685.png" alt="image-20230505160930685"></p>
<h2 id="网络安全-–-网络威胁与攻击"><a href="#网络安全-–-网络威胁与攻击" class="headerlink" title="网络安全  –  网络威胁与攻击"></a>网络安全  –  网络威胁与攻击</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505162647037.png" alt="image-20230505162647037"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505162754816.png" alt="image-20230505162754816"></p>
<h2 id="网络安全-–-防火墙"><a href="#网络安全-–-防火墙" class="headerlink" title="网络安全  –  防火墙"></a>网络安全  –  防火墙</h2><ul>
<li>屏蔽子网<ul>
<li>DMZ</li>
<li>弥补防外不防内</li>
<li>外网和内网间设置屏蔽区，为隔离区：放置对外服务的服务器(WEB服务器。。。)</li>
</ul>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505163212630.png" alt="image-20230505163212630"></p>
<hr>
<h1 id="数据结构"><a href="#数据结构" class="headerlink" title="数据结构"></a>数据结构</h1><h2 id="数组"><a href="#数组" class="headerlink" title="数组"></a>数组</h2><blockquote>
<p>len &#x3D; 元素的字节数</p>
</blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419200154425.png" alt="image-20230419200154425"></p>
<blockquote>
<p>例题</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419200359874.png" alt="image-20230419200359874"></p>
<p>解： a+(2x5+3)*2</p>
</blockquote>
<hr>
<h2 id="稀疏矩阵"><a href="#稀疏矩阵" class="headerlink" title="稀疏矩阵"></a>稀疏矩阵</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419201136436.png" alt="image-20230419201136436"></p>
<blockquote>
<p>例题：A</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419201913147.png" alt="image-20230419201913147"></p>
<p>代数计算，例如A(0,0)应该存在M数据的M[1]，A[1,0]–&gt;M[2]</p>
</blockquote>
<hr>
<h2 id="数据结构的定义"><a href="#数据结构的定义" class="headerlink" title="数据结构的定义"></a>数据结构的定义</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230419203543563.png" alt="image-20230419203543563"></p>
<hr>
<h2 id="线性表"><a href="#线性表" class="headerlink" title="线性表"></a>线性表</h2><p>链表：由一系列的结点组件，一个结点包含两个域，数据域和指针域（保存下一个结点的地址）</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505172406874.png" alt="image-20230505172406874"></p>
<ul>
<li><p>单链表</p>
</li>
<li><p>引入头节点，不存任何信息，可以令所有结点操作方式变成一致</p>
<ul>
<li><p>删除</p>
<p>（删除）q结点</p>
<figure class="highlight c"><table><tr><td class="code"><pre><span class="line">p-&gt;next = q-&gt;next</span><br></pre></td></tr></table></figure>


</li>
<li><p>插入</p>
<p>增加s结点</p>
<figure class="highlight c"><table><tr><td class="code"><pre><span class="line">s-&gt;next = p-&gt;next</span><br><span class="line">p-&gt;next = s</span><br></pre></td></tr></table></figure></li>
</ul>
</li>
</ul>
<h3 id="顺序存储与链式存储对比"><a href="#顺序存储与链式存储对比" class="headerlink" title="顺序存储与链式存储对比"></a>顺序存储与链式存储对比</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505174630041.png" alt="image-20230505174630041"></p>
<h3 id="队列与栈"><a href="#队列与栈" class="headerlink" title="队列与栈"></a>队列与栈</h3><ul>
<li><p>队列：先进先出（两端操作）</p>
</li>
<li><p>栈：先进后出（一端操作）</p>
</li>
<li><p>循环队列  –  尾指针指向下位空</p>
<ul>
<li>队空：头&#x3D;尾</li>
<li>队满：（只存n-1位数据）（尾下一位为头元素则满）尾+1%n&#x3D;0</li>
</ul>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505175554174.png" alt="image-20230505175554174"></p>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505175605047.png" alt="image-20230505175605047"></p>
<p>解：cba	abc	acb	bac	bca	</p>
</blockquote>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505180741374.png" alt="image-20230505180741374"></p>
<p>解：D（输出为靠左的依次输出）</p>
</blockquote>
<h2 id="广义表"><a href="#广义表" class="headerlink" title="广义表"></a>广义表</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505211922796.png" alt="image-20230505211922796"></p>
<ul>
<li>表中表</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505213939348.png" alt="image-20230505213939348"></p>
<ul>
<li><p><strong>长度</strong>：最外层的表包含多少个元素 </p>
</li>
<li><p><strong>深度</strong>:   有多少个不同的表，外表，子表</p>
</li>
<li><p>1…</p>
</li>
<li><p><strong>表头head(Ls)</strong>:第一个元素</p>
</li>
<li><p><strong>表尾tail(Ls)</strong>:除第一个元素其余都是表尾元素组成的<strong>新广义表</strong></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505214001373.png" alt="image-20230505214001373"></p>
</li>
</ul>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505213617003.png" alt="image-20230505213617003"></p>
<ul>
<li><p>长度：最外层的表包含多少个元素 (例如LS1的<strong>长度为3</strong>，第一为表元素，第二三为子表)</p>
</li>
<li><p>深度:   有多少个不同的表，外表，子表1…(例如LS1的<strong>深度为2</strong>，第一个为表元素，算重数1，第二个和第三个都一层子表，算重数1，1+1)</p>
</li>
</ul>
</blockquote>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505213631162.png" alt="image-20230505213631162"></p>
<ul>
<li>最后解只能取表头 </li>
<li>1.先取表尾 tail(LS1)&#x3D;((b,c),(d,e))</li>
<li>2.取表头 head(tail(LS1))&#x3D;(b,c)</li>
<li>3.再取表头  <strong>head（head(tail(LS1))）</strong>&#x3D;b</li>
</ul>
</blockquote>
<h2 id="树与二叉树"><a href="#树与二叉树" class="headerlink" title="树与二叉树"></a>树与二叉树</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505214524233.png" alt="image-20230505214524233"></p>
<ul>
<li>结点的度：拥有的孩子结点树 (结点1的度为 2）</li>
<li>树的度:  结点最高的度</li>
<li>叶子结点：4，5，7，8</li>
<li>分支结点:  有分支，1，2，3，6</li>
<li>内部结点：非叶子结点和根结点，2，3，6</li>
<li>兄弟结点:  同父</li>
<li>层次  :  同层结点</li>
</ul>
<h3 id="完全二叉树"><a href="#完全二叉树" class="headerlink" title="完全二叉树"></a>完全二叉树</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230505215222591.png" alt="image-20230505215222591"></p>
<ul>
<li>满二叉树：每一层满</li>
<li>完全二叉树：最后一层左边顺序排满，除了最后一层，其余全满</li>
</ul>
<h3 id="二叉树遍历"><a href="#二叉树遍历" class="headerlink" title="二叉树遍历"></a>二叉树遍历</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230506171331324.png" alt="image-20230506171331324"></p>
<ul>
<li>前序遍历（<strong>先访问根</strong>节点，再访问<strong>左子树结点</strong>，再访问<strong>右子树结点</strong> – <strong>根、左、右</strong>）：1、2、4、5、7、8、3、6</li>
<li>中序遍历（先访问<strong>左子树</strong>结点，<strong>再访问根节点</strong>，再访问<strong>右子树</strong>结点 – <strong>左、根、右</strong>）：4、2、7、8、5、1、3、6</li>
<li>后序遍历（先访问<strong>左子树</strong>结点，再访问<strong>右子树</strong>，再访问<strong>根</strong>结点 – <strong>左、右、根</strong>）：4、8、7、5、2、6、3、                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                               1</li>
<li>层次遍历（一层一层遍历）：1、2、3、4、5、6、7、8</li>
</ul>
<h3 id="反向构造二叉树"><a href="#反向构造二叉树" class="headerlink" title="反向构造二叉树"></a>反向构造二叉树</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230506172855718.png" alt="image-20230506172855718"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230506174517927.png" alt="image-20230506174517927"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230506174434166.png" alt="image-20230506174434166"></p>
<h3 id="树转二叉树"><a href="#树转二叉树" class="headerlink" title="树转二叉树"></a>树转二叉树</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230508234105881.png" alt="image-20230508234105881"></p>
<ul>
<li>孩子结点转为左子树的根节点，如果有多个孩子结点，采用最左边的孩子结点作为根结点，剩余的为兄弟结点</li>
<li>兄弟结点：全为树的右孩子结点，<strong>右边的兄弟为上一位兄弟的右节点</strong>，<strong>第二个孩子结点的根为孩子结点</strong></li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230508234220297.png" alt="image-20230508234220297"></p>
<ul>
<li>连线法（多个孩子则只保留一个孩子和父节点的连线，兄弟连起来）</li>
</ul>
<h3 id="查找二叉树"><a href="#查找二叉树" class="headerlink" title="查找二叉树"></a>查找二叉树</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230508234851015.png" alt="image-20230508234851015"></p>
<h3 id="最优二叉树（哈夫曼树）"><a href="#最优二叉树（哈夫曼树）" class="headerlink" title="最优二叉树（哈夫曼树）"></a>最优二叉树（哈夫曼树）</h3><ul>
<li><p><strong>不计算中间结点，只计算叶子结点</strong></p>
</li>
<li><p>树的路径长度：每段累加起来的长度，有多少树枝</p>
</li>
<li><p>权：某个叶子结点的数值，数值代表某种数据出现的频度</p>
</li>
<li><p>带权路径长度：路径长度 * 权 （例结点2：带权路径长度&#x3D;2 * 2，例结点4：带权路径长度&#x3D;3 * 4）</p>
</li>
<li><p>树的带权路径长度(只计算孩子结点，根节点排除)：所有的带权路径长度累加   （例1：47  例2：25）</p>
</li>
<li><p>构造哈夫曼树：树的带权路径长度最短</p>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230508235928078.png" alt="image-20230508235928078"></p>
<p>例题</p>
<ul>
<li><strong>选取两棵根结点权值最小的树</strong></li>
<li>选两个加起来的权最小作为新树</li>
</ul>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230508235943618.png" alt="image-20230508235943618"></p>
<p>先选两个最小权值权值的，计算和，然后替换原来的两个最小的，一直替换，生成树</p>
<p>①（当前3+5&#x3D;8 -&gt; min） 选 3，5 构成树，根 8  ，当前组的权值变为  29，7，8，14，23，11，8</p>
<p>②(当前7+8&#x3D;-15 -&gt; min）选 7，8 构成树 ，根15，当前组的权值变为  29，8，14，23，11，15</p>
<p>③(当前8+11&#x3D;19 -&gt; min）选8，11 构成树，根19，当前组的权值变为  29，14，23，15，19</p>
<p>④(当前14+15&#x3D;29 -&gt; min）选14，15 构成树，根29，当前组的权值变为  29，23，19，29</p>
<p>⑤(当前19+23&#x3D;42 -&gt; min）选19，23 构成树，根42，当前组的权值变为  29，42，29</p>
<p>⑥(当前29+29&#x3D;58 -&gt; min）选29，29 构成树，根58，当前组的权值变为  42，58</p>
<p>⑥(当前42+58&#x3D;100 -&gt; min）选42，58 构成树，根100</p>
<p>哈夫曼树的带权路径长度：5 * 5+3 * 5+7 * 4+14 * 3+29 * 2+8 * 3+11 * 3+23 * 2</p>
</blockquote>
<h3 id="线索二叉树"><a href="#线索二叉树" class="headerlink" title="线索二叉树"></a>线索二叉树</h3><ul>
<li>在二叉树的基础上存在虚线把各结点串起来</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509005418057.png" alt="image-20230509005418057"></p>
<p>例如孩子结点左右都为空指针，有一些根节点的左或右为空</p>
<ul>
<li><p><strong>左子树的指针指向遍历的 前驱结点</strong></p>
</li>
<li><p><strong>右子树的指针指向遍历的 后驱结点</strong></p>
</li>
<li><p>前序线索二叉树：前序遍历结果：A，B，D，E，H，C，F，G，I</p>
<ul>
<li>D的前驱结点为B，后驱结点为E</li>
</ul>
</li>
</ul>
<h3 id="平衡二叉树"><a href="#平衡二叉树" class="headerlink" title="平衡二叉树"></a>平衡二叉树</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509140453507.png" alt="image-20230509140453507"></p>
<ul>
<li>深度：多少个孩子结点  (结点7的深度为3)</li>
<li>平衡度：结点的 左深度 减 右深度  （如1的平衡度&#x3D;0-0&#x3D;0，如5的平衡度&#x3D;1-0&#x3D;1，8的平衡度&#x3D;0-1&#x3D;-1，39的平衡度&#x3D;3-0&#x3D;3）</li>
</ul>
<h2 id="图"><a href="#图" class="headerlink" title="图"></a>图</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509141931328.png" alt="image-20230509141931328"></p>
<h2 id="图的存储"><a href="#图的存储" class="headerlink" title="图的存储"></a>图的存储</h2><h3 id="邻接矩阵"><a href="#邻接矩阵" class="headerlink" title="邻接矩阵"></a>邻接矩阵</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509142127526.png" alt="image-20230509142127526"></p>
<ul>
<li>N x N 二维表</li>
</ul>
<h3 id="邻接表"><a href="#邻接表" class="headerlink" title="邻接表"></a>邻接表</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509142347464.png" alt="image-20230509142347464"></p>
<h2 id="图的遍历"><a href="#图的遍历" class="headerlink" title="图的遍历"></a>图的遍历</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509142558585.png" alt="image-20230509142558585"></p>
<ul>
<li>深度：访问到最后一个结点再返回  –  1、2、4、8、5、3、6、7</li>
<li>广度：遍历同层  –  1、2、3、4、5、6、7、8</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509143109482.png" alt="image-20230509143109482"></p>
<ul>
<li>深度：0、4、6、7、3、1、2、5、3</li>
<li>广度：0、1、3、4、6、2、5、7</li>
</ul>
<h2 id="拓扑排序"><a href="#拓扑排序" class="headerlink" title="拓扑排序"></a>拓扑排序</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509143535300.png" alt="image-20230509143535300"></p>
<ul>
<li>要使箭头前的结点全部完成（不分先后）才能输出，<strong>不受约束才能执行</strong></li>
</ul>
<h2 id="图的最小生成树"><a href="#图的最小生成树" class="headerlink" title="图的最小生成树"></a>图的最小生成树</h2><h3 id="普里姆算法"><a href="#普里姆算法" class="headerlink" title="普里姆算法"></a>普里姆算法</h3><ul>
<li>树没有环路 ：边&#x3D; n - 1</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509144051530.png" alt="image-20230509144051530"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509144714950.png" alt="image-20230509144714950"></p>
<ul>
<li><p>定义红点集：<strong>从红点集出发</strong>，比如接入了B，则A-B为红点集，<strong>判断哪个点到红点集里面哪个点最短，则纳入下一个点为红点集</strong></p>
</li>
<li><p>定义蓝点集：剩余的点</p>
</li>
<li><p><strong>不能形成环</strong></p>
</li>
</ul>
<h3 id="克鲁斯卡尔算法"><a href="#克鲁斯卡尔算法" class="headerlink" title="克鲁斯卡尔算法"></a>克鲁斯卡尔算法</h3><ul>
<li><p>选当前最短的边，多条则一起选</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509144915382.png" alt="image-20230509144915382"></p>
</li>
</ul>
<h1 id="算法"><a href="#算法" class="headerlink" title="算法"></a>算法</h1><h2 id="算法的特性"><a href="#算法的特性" class="headerlink" title="算法的特性"></a>算法的特性</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509145012446.png" alt="image-20230509145012446"></p>
<h2 id="算法的复杂度"><a href="#算法的复杂度" class="headerlink" title="算法的复杂度"></a>算法的复杂度</h2><h3 id="时间复杂度-–-考试频率高"><a href="#时间复杂度-–-考试频率高" class="headerlink" title="时间复杂度  – 考试频率高"></a>时间复杂度  – 考试频率高</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509145324347.png" alt="image-20230509145324347"></p>
<ul>
<li>O(1) : 一条语句：例如赋值、输出</li>
<li>O(n) : 一层循环，次数为n或n条语句</li>
<li>O(n*2) : 两层循环，每层次数为n</li>
<li>O(n*3) : 三层循环，每层次数为n</li>
<li>log(2n) : 例如平衡很高的排序二叉树，查找键值，先跟顶结点比较再跟下层结点比较，如果当前二叉树为当前为3层，则需要比较3次，所<strong>n为结点的数量</strong></li>
</ul>
<h3 id="空间复杂度"><a href="#空间复杂度" class="headerlink" title="空间复杂度"></a>空间复杂度</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509145341719.png" alt="image-20230509145341719"></p>
<h2 id="查找"><a href="#查找" class="headerlink" title="查找"></a>查找</h2><h3 id="顺序查找"><a href="#顺序查找" class="headerlink" title="顺序查找"></a>顺序查找</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509150714475.png" alt="image-20230509150714475"></p>
<ul>
<li>平均查找长度：平均比较次数，例如上图，最好的情况比较 1 次，最坏比较 8 次，则平均查找长度为（1+8）&#x2F;2</li>
<li>时间复杂度：O(n)</li>
</ul>
<h3 id="二分查找"><a href="#二分查找" class="headerlink" title="二分查找"></a>二分查找</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509151131357.png" alt="image-20230509151131357"></p>
<blockquote>
<p>例题</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509151513846.png" alt="image-20230509151513846"></p>
<ul>
<li>mid中间值：(low+high)&#x2F;2 得数取整 为 6</li>
<li>不停的和中间值比较，如果比较过则免除</li>
<li>最多比较次数：[Log2n]+1</li>
<li>时间复杂度：O(log2n)</li>
</ul>
</blockquote>
<h3 id="查找-散列表"><a href="#查找-散列表" class="headerlink" title="查找-散列表"></a>查找-散列表</h3><ul>
<li>按内容存储，</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509161502022.png" alt="image-20230509161502022"></p>
<p>例题</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509161519832.png" alt="image-20230509161519832"></p>
<ul>
<li>h&#x3D;key%p</li>
<li>3%5&#x3D;3</li>
<li><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509161706105.png" alt="image-20230509161706105"></li>
<li>8%5&#x3D;3冲突，使用线性探测法，放到下一位空间</li>
<li>12%5&#x3D;2</li>
<li>17%5&#x3D;2，冲突，计划按照线性探测法放到3号，3号被3占用，4号被8占用，则放到5号位置</li>
<li>9%5&#x3D;4，冲突，4、5被占用，放到6号</li>
</ul>
<h2 id="排序"><a href="#排序" class="headerlink" title="排序"></a>排序</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230525220205364.png" alt="image-20230525220205364"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509162322091.png" alt="image-20230509162322091"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510004350190.png" alt="image-20230510004350190"></p>
<h3 id="直接插入排序"><a href="#直接插入排序" class="headerlink" title="直接插入排序"></a>直接插入排序</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509164044586.png" alt="image-20230509164044586"></p>
<h3 id="希尔排序"><a href="#希尔排序" class="headerlink" title="希尔排序"></a>希尔排序</h3><ul>
<li>根据d设置<strong>间隔</strong>进行排序交换双方数值</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509164105785.png" alt="image-20230509164105785"></p>
<h3 id="直接选择排序"><a href="#直接选择排序" class="headerlink" title="直接选择排序"></a>直接选择排序</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509165743168.png" alt="image-20230509165743168"></p>
<h3 id="堆排序"><a href="#堆排序" class="headerlink" title="堆排序"></a>堆排序</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509170301145.png" alt="image-20230509170301145"></p>
<ul>
<li><p>小顶堆：孩子结点比父节点打</p>
</li>
<li><p>大顶堆：父节点最大</p>
<blockquote>
<p>大顶堆：</p>
<p>①以完全二叉树排下来，每层从左到右填满</p>
<p>②父节点跟孩子结点比较，存在孩子大则替换，</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509171314902.png" alt="image-20230509171314902"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230509171732389.png" alt="image-20230509171732389"></p>
<ul>
<li>①把顶取走，把最后一个结点 20 替换顶 80</li>
<li>②进行调整：把顶点和孩子对比，和最大的孩子交换</li>
<li>③再跟孩子比较，和最大的孩子交换</li>
<li>④再把顶拿走，最后一个结点上位为顶，继续进行比较替换</li>
</ul>
<p>一次次取出来的顶组合成顺序表则为堆排序后的顺序表</p>
</blockquote>
</li>
</ul>
<h3 id="冒泡排序"><a href="#冒泡排序" class="headerlink" title="冒泡排序"></a>冒泡排序</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510002509153.png" alt="image-20230510002509153"></p>
<h3 id="快速排序"><a href="#快速排序" class="headerlink" title="快速排序"></a>快速排序</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510002737483.png" alt="image-20230510002737483"></p>
<ul>
<li>小于基准的，和基准交换，往前放</li>
<li>大于基准的，和基准交换，往后放</li>
<li>最后基准前面的元素都比基准小，基准后都大于基准，则对这两个数组排序则得到排序后的数据</li>
</ul>
<h3 id="归并排序"><a href="#归并排序" class="headerlink" title="归并排序"></a>归并排序</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510003317180.png" alt="image-20230510003317180"></p>
<ul>
<li>57 和 52 比较，52 添加到R数组中，然后 57 和 59 比较，57复制到R中，然后 68 和 59并比较，59 添加到R，最后 68 添加到R，得到一次归并的排序后表，多次子表归并后则得到总排序表</li>
</ul>
<h3 id="基数排序"><a href="#基数排序" class="headerlink" title="基数排序"></a>基数排序</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510003923906.png" alt="image-20230510003923906"></p>
<ul>
<li>先按数的个位排序得到新的有序表</li>
<li>再按数的十位排序得到新的有序表</li>
<li>再按数的百位排序得到新的有序表</li>
</ul>
<h1 id="程序设计语言与语言处理程序基础"><a href="#程序设计语言与语言处理程序基础" class="headerlink" title="*程序设计语言与语言处理程序基础"></a>*程序设计语言与语言处理程序基础</h1><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510004854183.png" alt="image-20230510004854183"></p>
<h2 id="编译过程"><a href="#编译过程" class="headerlink" title="编译过程"></a>编译过程</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510224949191.png" alt="image-20230510224949191"></p>
<ul>
<li><p>编译：编写完<strong>全部代码</strong>，编译运行才编译成目标程序</p>
</li>
<li><p>解释：编写完<strong>一段代码</strong>，编译器则后台进行解释看有没有写错误</p>
</li>
<li><p>词法错误：非法字符，关键字或标识符拼写错误</p>
</li>
<li><p>语法错误：语法结构出错，if endif不匹配，缺分号</p>
</li>
<li><p>语义错误：死循环，零除数，其它逻辑错误</p>
</li>
<li><p>目标代码：可执行的代码，涉及操作系统、底层硬件</p>
</li>
</ul>
<h2 id="文法定义"><a href="#文法定义" class="headerlink" title="文法定义"></a>文法定义</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510225941840.png" alt="image-20230510225941840"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510230111944.png" alt="image-20230510230111944"></p>
<ul>
<li>上下文无关法：广泛用于语法规则</li>
</ul>
<h2 id="语法推导树"><a href="#语法推导树" class="headerlink" title="语法推导树"></a>语法推导树</h2><ul>
<li>语法推导：表达的串，构造的类型</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510233629334.png" alt="image-20230510233629334"></p>
<p>例题： </p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230510233650355.png" alt="image-20230510233650355"></p>
<ul>
<li><strong>终结符</strong>：{a,b}  一般在{ }的<strong>小写字母</strong>代表，终结符不能推导出别的元素</li>
<li><strong>非终结符</strong>：这种符号可以推出其他符号，一般在{ }的<strong>大写字母</strong>在{ }表示，终结符可以推导出别的元素</li>
<li><strong>起始符</strong>：S</li>
<li><strong>产生式 \ 推导式</strong>：P、S-&gt;aAS|a、A-&gt;SbA|SS|ba<ul>
<li>S-&gt;aAS|a  ： S-&gt;aAS 、S-&gt;a</li>
</ul>
</li>
</ul>
<h2 id="有限自动机"><a href="#有限自动机" class="headerlink" title="有限自动机"></a>有限自动机</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230511200830790.png" alt="image-20230511200830790"></p>
<ul>
<li>起始：S</li>
<li>结束：双圈代表结束点来的串**</li>
</ul>
<p>例题：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230511203414580.png" alt="image-20230511203414580"></p>
<blockquote>
<p>解：</p>
<p>以选项的串进行输入，输入完毕看能不能从起始点到结束点</p>
</blockquote>
<h2 id="正规式"><a href="#正规式" class="headerlink" title="正规式"></a>正规式</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230511201450205.png" alt="image-20230511201450205"></p>
<p>实例</p>
<ul>
<li><p>（a|b)*  代表：a 或 b ，a，b，aa，bb  …….</p>
</li>
<li><p>*** 代表多次**，0~无穷大，可代表空串</p>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230511203038053.png" alt="image-20230511203038053"></p>
<ul>
<li>1、D：按选项进行校验</li>
<li>2、C：看能不能代表能实现所有可能的串</li>
</ul>
<h2 id="表达式"><a href="#表达式" class="headerlink" title="表达式"></a>表达式</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230511204020576.png" alt="image-20230511204020576"></p>
<ul>
<li>D：先构造树：看题目，后缀表达式则为后序遍历树（左右根 ab-c5+*）</li>
</ul>
<h2 id="传值和传址"><a href="#传值和传址" class="headerlink" title="传值和传址"></a>传值和传址</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512150921678.png" alt="image-20230512150921678"></p>
<h2 id="各程序语言特点"><a href="#各程序语言特点" class="headerlink" title="各程序语言特点"></a>各程序语言特点</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512151028793.png" alt="image-20230512151028793"></p>
<h2 id="中间代码"><a href="#中间代码" class="headerlink" title="中间代码"></a>中间代码</h2><p>中间代码是源程序的一种内部表示，或称中间语言。中间代码的作用是可使编译程序的结构在逻辑上更为简单明确，使用中间代码可提高编译程序的可移植性，常见的有逆波兰记号、四元式、三元式和树。</p>
<h1 id="法律法规"><a href="#法律法规" class="headerlink" title="法律法规"></a>法律法规</h1><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512151354453.png" alt="image-20230512151354453"></p>
<h2 id="保护期限"><a href="#保护期限" class="headerlink" title="保护期限"></a>保护期限</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512152156967.png" alt="image-20230512152156967"></p>
<h2 id="知识产权人确定"><a href="#知识产权人确定" class="headerlink" title="知识产权人确定"></a>知识产权人确定</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512152825615.png" alt="image-20230512152825615"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512160818519.png" alt="image-20230512160818519"></p>
<h2 id="侵权判定"><a href="#侵权判定" class="headerlink" title="侵权判定"></a>侵权判定</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512172244441.png" alt="image-20230512172244441"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512174143911.png" alt="image-20230512174143911"></p>
<h1 id="标准化"><a href="#标准化" class="headerlink" title="标准化"></a>标准化</h1><h2 id="表准的分类"><a href="#表准的分类" class="headerlink" title="表准的分类"></a>表准的分类</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512200240669.png" alt="image-20230512200240669"></p>
<h2 id="标准的编号"><a href="#标准的编号" class="headerlink" title="标准的编号"></a>标准的编号</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512200543996.png" alt="image-20230512200543996"></p>
<h1 id="多媒体基础"><a href="#多媒体基础" class="headerlink" title="多媒体基础"></a>多媒体基础</h1><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512201118262.png" alt="image-20230512201118262"></p>
<h2 id="音频"><a href="#音频" class="headerlink" title="音频"></a>音频</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512201139400.png" alt="image-20230512201139400"></p>
<ul>
<li>次声波、低声波：&lt; 20Hz</li>
<li>超声波： &gt; 20kHz</li>
<li>保证不失真：采样频率为被采样的音种最高率的两倍</li>
</ul>
<h2 id="图像"><a href="#图像" class="headerlink" title="图像"></a>图像</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512201809791.png" alt="image-20230512201809791"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512203958334.png" alt="image-20230512203958334"></p>
<ul>
<li>RGB：彩色显示器</li>
<li>YUV：电视机</li>
<li>CMY(CMYK)：印刷</li>
<li>HSV(HSB)：艺术</li>
</ul>
<h2 id="媒体种类"><a href="#媒体种类" class="headerlink" title="媒体种类"></a>媒体种类</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512205453229.png" alt="image-20230512205453229"></p>
<h2 id="多媒体相关计算"><a href="#多媒体相关计算" class="headerlink" title="多媒体相关计算"></a>多媒体相关计算</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512205649895.png" alt="image-20230512205649895"></p>
<ul>
<li><p>求容量 </p>
</li>
<li><p>像素 x 位数 ： 位数，每个像素为16位：16 &#x2F; 8 &#x3D; 占2字节  &#x3D;像素 x 位数的字节</p>
</li>
<li><p>像素 x 色数：256色的图像：占2^k&#x3D;256  ,8位  占1字节   &#x3D;像素 x 色数的字节</p>
</li>
</ul>
<p>例题</p>
<blockquote>
<ul>
<li>K&#x3D;1024：1024只在存储使用</li>
<li>传输k为1000</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512213424019.png" alt="image-20230512213424019"></p>
<ul>
<li>1、颜色深度24位占3字节</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512213201288.png" alt="image-20230512213201288"></p>
</blockquote>
<h2 id="常见多媒体标准"><a href="#常见多媒体标准" class="headerlink" title="常见多媒体标准"></a>常见多媒体标准</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512213719328.png" alt="image-20230512213719328"></p>
<h2 id="数据压缩基础"><a href="#数据压缩基础" class="headerlink" title="数据压缩基础"></a>数据压缩基础</h2><ul>
<li>压缩前提：存在冗余</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512215000821.png" alt="image-20230512215000821"></p>
<h2 id="有损压缩与无损压缩"><a href="#有损压缩与无损压缩" class="headerlink" title="有损压缩与无损压缩"></a>有损压缩与无损压缩</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512215754926.png" alt="image-20230512215754926"></p>
<h1 id="软件工程"><a href="#软件工程" class="headerlink" title="软件工程"></a>软件工程</h1><h2 id="开发模型"><a href="#开发模型" class="headerlink" title="开发模型"></a>开发模型</h2><h3 id="瀑布模型"><a href="#瀑布模型" class="headerlink" title="瀑布模型"></a>瀑布模型</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512220259550.png" alt="image-20230512220259550"></p>
<ul>
<li>瀑布模型：结构化方法中的模型，只适用于需求清晰的项目</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230512220526937.png" alt="image-20230512220526937"></p>
<h3 id="增量模型与螺旋模型"><a href="#增量模型与螺旋模型" class="headerlink" title="增量模型与螺旋模型"></a>增量模型与螺旋模型</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513000300616.png" alt="image-20230513000300616"></p>
<h3 id="其他经典模型"><a href="#其他经典模型" class="headerlink" title="其他经典模型"></a>其他经典模型</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513000915580.png" alt="image-20230513000915580"></p>
<h3 id="构建组模型-CBSD"><a href="#构建组模型-CBSD" class="headerlink" title="构建组模型(CBSD)"></a>构建组模型(CBSD)</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513001841679.png" alt="image-20230513001841679"></p>
<h3 id="统一过程UP"><a href="#统一过程UP" class="headerlink" title="统一过程UP"></a>统一过程UP</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513002515044.png" alt="image-20230513002515044"></p>
<h3 id="敏捷开发方法"><a href="#敏捷开发方法" class="headerlink" title="敏捷开发方法"></a>敏捷开发方法</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513104632677.png" alt="image-20230513104632677"></p>
<h2 id="信息系统开发方法"><a href="#信息系统开发方法" class="headerlink" title="信息系统开发方法"></a>信息系统开发方法</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513105309213.png" alt="image-20230513105309213"></p>
<h2 id="需求开发-需求分类与需求获取"><a href="#需求开发-需求分类与需求获取" class="headerlink" title="需求开发 - 需求分类与需求获取"></a>需求开发 - 需求分类与需求获取</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513111051022.png" alt="image-20230513111051022"></p>
<h2 id="结构化设计"><a href="#结构化设计" class="headerlink" title="结构化设计"></a>结构化设计</h2><h3 id="基本原则"><a href="#基本原则" class="headerlink" title="基本原则"></a>基本原则</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513112248505.png" alt="image-20230513112248505"></p>
<h3 id="内聚和耦合"><a href="#内聚和耦合" class="headerlink" title="内聚和耦合"></a>内聚和耦合</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513112809462.png" alt="image-20230513112809462"></p>
<h3 id="系统结构-x2F-模块结构"><a href="#系统结构-x2F-模块结构" class="headerlink" title="系统结构&#x2F;模块结构"></a>系统结构&#x2F;模块结构</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513112907176.png" alt="image-20230513112907176"></p>
<h1 id="软件测试"><a href="#软件测试" class="headerlink" title="软件测试"></a>软件测试</h1><h2 id="测试原则与类型"><a href="#测试原则与类型" class="headerlink" title="测试原则与类型"></a>测试原则与类型</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513113416265.png" alt="image-20230513113416265"></p>
<ul>
<li>回归测试：把之前测试过的模块重新设计</li>
<li>代码走查：人工执行</li>
</ul>
<h2 id="测试用例设计"><a href="#测试用例设计" class="headerlink" title="测试用例设计"></a>测试用例设计</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513114507299.png" alt="image-20230513114507299"></p>
<ul>
<li><p>黑盒测试：例如只知道模块功能，输入输出暂未知</p>
</li>
<li><p>白盒测试：看到程序内部结构，把所有的路径都进行测试</p>
</li>
<li><p>语句覆盖：全部语句都执行一遍   层次级最低</p>
</li>
<li><p>判定覆盖：真假分支都要执行</p>
</li>
<li><p>条件覆盖：把判定拆分开，</p>
</li>
<li><p>路径覆盖：所有可能都覆盖了，最高层级</p>
</li>
</ul>
<h2 id="测试阶段"><a href="#测试阶段" class="headerlink" title="测试阶段"></a>测试阶段</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513141825427.png" alt="image-20230513141825427"></p>
<ul>
<li>单元测试：测局部功能、模块的相关接口</li>
<li>集成测试：模块之间的衔接</li>
</ul>
<h2 id="McCabe复杂度"><a href="#McCabe复杂度" class="headerlink" title="McCabe复杂度"></a>McCabe复杂度</h2><ul>
<li>计算：V(G)&#x3D;m-n+2</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513143032692.png" alt="image-20230513143032692"></p>
<ul>
<li>结点：分叉的地方可抽象为结点，也可不抽象为结点</li>
</ul>
<h2 id="CMMI"><a href="#CMMI" class="headerlink" title="CMMI"></a>CMMI</h2><ul>
<li>级别：一级~五级</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513145242474.png" alt="image-20230513145242474"></p>
<h1 id="项目管理"><a href="#项目管理" class="headerlink" title="项目管理"></a>项目管理</h1><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513145743779.png"></p>
<h2 id="时间管理"><a href="#时间管理" class="headerlink" title="时间管理"></a>时间管理</h2><ul>
<li>甘特图：简单明了，各任务逻辑、依赖关系不清楚，</li>
<li>PERT图：圆圈，<ul>
<li>右上为<strong>最早开始时间</strong>：<strong>前序任务都完成的情况下</strong>，即多个前结点箭头上的<strong>最长</strong>持续时间后，例如：6，前两个持续时间分别为3、4，即4为最长</li>
<li>右下为<strong>最晚开始时间</strong>：求出最后一个任务的最早完成时间后，则最晚时间&#x3D;最早时间，开始逆推-持续时间</li>
</ul>
</li>
</ul>
<h2 id="风险管理"><a href="#风险管理" class="headerlink" title="风险管理"></a>风险管理</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513150840270.png" alt="image-20230513150840270"></p>
<h1 id="面向对象设计"><a href="#面向对象设计" class="headerlink" title="面向对象设计"></a>面向对象设计</h1><h2 id="需求工程"><a href="#需求工程" class="headerlink" title="需求工程"></a>需求工程</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513151503991.png" alt="image-20230513151503991"></p>
<h2 id="设计原则"><a href="#设计原则" class="headerlink" title="设计原则"></a>设计原则</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513152113663.png" alt="image-20230513152113663"></p>
<h2 id="UML"><a href="#UML" class="headerlink" title="UML"></a>UML</h2><ul>
<li>用例图：行为图、动态图|静态图（系统和外部的交互关系）</li>
<li>顺序图：按顺序</li>
<li>状态图：状态的变迁的转移情况</li>
<li>活动图：和流程图结构一致</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513161056060.png" alt="image-20230513161056060"></p>
<h2 id="设计模式的概念"><a href="#设计模式的概念" class="headerlink" title="设计模式的概念"></a>设计模式的概念</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513161511873.png" alt="image-20230513161511873"></p>
<ul>
<li>架构模式：高层决策</li>
</ul>
<h2 id="设计模式的分类"><a href="#设计模式的分类" class="headerlink" title="设计模式的分类"></a>设计模式的分类</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513162043828.png" alt="image-20230513162043828"></p>
<h2 id="创建型模式"><a href="#创建型模式" class="headerlink" title="创建型模式"></a>创建型模式</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513162606800.png" alt="image-20230513162606800"></p>
<ul>
<li>原型模式：克隆模式</li>
</ul>
<h2 id="结构型模式"><a href="#结构型模式" class="headerlink" title="结构型模式"></a>结构型模式</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513163705619.png" alt="image-20230513163705619"></p>
<h2 id="行为型模式"><a href="#行为型模式" class="headerlink" title="行为型模式"></a>行为型模式</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513164237556.png" alt="image-20230513164237556"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230513165442740.png" alt="image-20230513165442740"></p>
<h2 id="数据流图-DFD"><a href="#数据流图-DFD" class="headerlink" title="数据流图(DFD)"></a>数据流图(DFD)</h2><h2 id="下午题1"><a href="#下午题1" class="headerlink" title="下午题1"></a>下午题1</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230523140900358.png" alt="image-20230523140900358"></p>
<ul>
<li><h3 id="存储题目没有名字，根据数据流名称-表，自拟"><a href="#存储题目没有名字，根据数据流名称-表，自拟" class="headerlink" title="存储题目没有名字，根据数据流名称+表，自拟"></a><strong>存储题目没有名字，根据数据流名称+表</strong>，<strong>自拟</strong></h3></li>
</ul>
<h3 id="基本概念"><a href="#基本概念" class="headerlink" title="基本概念"></a>基本概念</h3><p> <img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514164821178.png" alt="image-20230514164821178"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514165307624.png" alt="image-20230514165307624"></p>
<h3 id="数据字典"><a href="#数据字典" class="headerlink" title="数据字典"></a>数据字典</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514172812236.png" alt="image-20230514172812236"></p>
<h3 id="数据流图平衡原则"><a href="#数据流图平衡原则" class="headerlink" title="数据流图平衡原则"></a>数据流图平衡原则</h3><ul>
<li><h3 id="父图和子图之间的平衡"><a href="#父图和子图之间的平衡" class="headerlink" title="父图和子图之间的平衡"></a>父图和子图之间的平衡</h3></li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514174247978.png" alt="image-20230514174247978"></p>
<ul>
<li><p>顶层数据流图 和 0层数据流图 对比：<strong>找出缺少的数据流，一一匹配，指向方向</strong>：缺少-&gt;处理后的操作结果</p>
</li>
<li><h1 id="1、父图子图平衡"><a href="#1、父图子图平衡" class="headerlink" title="1、父图子图平衡"></a>1、父图子图平衡</h1></li>
<li><h1 id="2、加工既有输入流也要有输出流：加工至少有一条输入和输出流，只有输入无输出-gt-黑洞-只有输出无输入-gt-奇迹"><a href="#2、加工既有输入流也要有输出流：加工至少有一条输入和输出流，只有输入无输出-gt-黑洞-只有输出无输入-gt-奇迹" class="headerlink" title="2、加工既有输入流也要有输出流：加工至少有一条输入和输出流，只有输入无输出  -&gt;  黑洞     只有输出无输入  -&gt;  奇迹"></a>2、加工既有输入流也要有输出流：加工至少有一条输入和输出流，只有输入无输出  -&gt;  黑洞     只有输出无输入  -&gt;  奇迹</h1></li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514174603688.png" alt="image-20230514174603688"></p>
<ul>
<li><h1 id="3、数据守恒：题目的生成标题对应多少个加工数量"><a href="#3、数据守恒：题目的生成标题对应多少个加工数量" class="headerlink" title="3、数据守恒：题目的生成标题对应多少个加工数量"></a>3、数据守恒：题目的生成标题对应多少个加工数量</h1></li>
<li><p><strong>数据流的起点或终点必须有一个是加工</strong></p>
</li>
</ul>
<h3 id="答题技巧"><a href="#答题技巧" class="headerlink" title="答题技巧"></a>答题技巧</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514174753049.png" alt="image-20230514174753049"></p>
<ul>
<li><h2 id="试题1"><a href="#试题1" class="headerlink" title="试题1"></a>试题1</h2></li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514203904247.png" alt="image-20230514203904247"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514204016978.png" alt="image-20230514204016978"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514204046569.png" alt="image-20230514204046569"></p>
<blockquote>
<p>答案</p>
<p>1、和文本进行审题</p>
<p>2、文本审题</p>
<p>3、和顶层图进行比较，看缺少哪个步骤：①处理后的操作结果：P-&gt;E1 ; ②操作结果：E3-&gt;P</p>
<p>4、实现有入一定要有出</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514211720602.png" alt="image-20230514211720602"></p>
</blockquote>
<ul>
<li><h2 id="试题2"><a href="#试题2" class="headerlink" title="试题2"></a>试题2</h2></li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514212709418.png" alt="image-20230514212709418"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514212750230.png" alt="image-20230514212750230"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514212807609.png" alt="image-20230514212807609"></p>
<blockquote>
<p>解：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514215224644.png" alt="image-20230514215224644"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/IMG_20230514_215912.jpg" alt="IMG_20230514_215912"></p>
</blockquote>
<h1 id="数据库设计"><a href="#数据库设计" class="headerlink" title="数据库设计"></a>数据库设计</h1><ul>
<li><h2 id="回答模板"><a href="#回答模板" class="headerlink" title="回答模板"></a>回答模板</h2></li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230524183844208.png" alt="image-20230524183844208"></p>
<ul>
<li><h1 id="主键外键：把1方写入多方，"><a href="#主键外键：把1方写入多方，" class="headerlink" title="主键外键：把1方写入多方，"></a>主键外键：把1方写入多方，</h1></li>
<li><p>外模式、模式和内模式：视图、基本表和存储文件</p>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230514220022603.png" alt="image-20230514220022603"></p>
<h2 id="数据库设计过程-1"><a href="#数据库设计过程-1" class="headerlink" title="数据库设计过程"></a>数据库设计过程</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230515225538389.png" alt="image-20230515225538389"></p>
<h2 id="E-R模型-1"><a href="#E-R模型-1" class="headerlink" title="E-R模型"></a>E-R模型</h2><h3 id="实体间联系类型"><a href="#实体间联系类型" class="headerlink" title="实体间联系类型"></a>实体间联系类型</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230515225919851.png" alt="image-20230515225919851"></p>
<ul>
<li><h2 id="实体"><a href="#实体" class="headerlink" title="实体"></a>实体</h2></li>
<li><p>弱实体：双框，前提必须以另一个实体存在才存在</p>
</li>
<li><p><strong>继承</strong>：线加圆圈</p>
</li>
<li><p><strong>子实体</strong>：两条杠</p>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230524133228165.png" alt="image-20230524133228165"></p>
<ul>
<li><h2 id="属性"><a href="#属性" class="headerlink" title="属性"></a>属性</h2></li>
<li><p>主键：下划线</p>
</li>
<li><p>字段名称：椭圆</p>
</li>
</ul>
<h3 id="图向关系模型的转换"><a href="#图向关系模型的转换" class="headerlink" title="图向关系模型的转换"></a>图向关系模型的转换</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230515230308495.png" alt="image-20230515230308495"></p>
<ul>
<li><p>一对一：可以把联系合并到其中一个实体内</p>
</li>
<li><p>一对多：只可以把联系合并到<strong>多</strong>的实体</p>
</li>
<li><p>多对多：必须单独转为一个关系模式</p>
</li>
<li></li>
</ul>
<h2 id="答题技巧-1"><a href="#答题技巧-1" class="headerlink" title="答题技巧"></a>答题技巧</h2><p>例题1：</p>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230515232123632.png" alt="image-20230515232123632"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230515232214570.png" alt="image-20230515232214570"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230515232259195.png" alt="image-20230515232259195"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230515233717617.png" alt="image-20230515233717617"></p>
<p>解析：</p>
<p>问题1：（1）1：n(1个部门对应多个员工)、（2）m 、（3）n</p>
<p>问题2：(不要求关联名称)</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230516001240595.png" alt="image-20230516001240595"></p>
<p>问题3：(4)员工号，部门号、(5)客房号、(6)身份证号、(7)岗位、(8)客房号、身份证号</p>
<p>问题4：优点：减少连接操作</p>
<p>​			 缺点：数据产生冗余，重复存储</p>
</blockquote>
<p>例题2：</p>
<blockquote>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517002403545.png" alt="image-20230517002403545"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517002841564.png" alt="image-20230517002841564"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517002511690.png" alt="image-20230517002511690"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517002537060.png" alt="image-20230517002537060"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517002601619.png" alt="image-20230517002601619"></p>
<p>解：</p>
<p>问题1</p>
<ul>
<li>经理是特殊员工： 用横线中间圆圈表示，且特殊的职位设置两条竖线</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517005212060.png" alt="image-20230517005212060"></p>
<p>问题2</p>
<p>a：商场编号</p>
<p>b：部门编号</p>
<p>c：员工编号</p>
<p>部门 – 主键：部门编号、外键：商城编号</p>
<p>员工 – 主键：员工编号、外键：部门编号</p>
<p>经理 – 主键：员工编号、外键：员工编号</p>
<p>问题3：</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517011449989.png" alt="image-20230517011449989"></p>
<p>添加的实体：紧急联系人（员工编号、姓名、电话）</p>
<p>联系：1：n</p>
</blockquote>
<h1 id="UML建模"><a href="#UML建模" class="headerlink" title="UML建模"></a>UML建模</h1><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230525001128636.png" alt="image-20230525001128636"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517011633239.png" alt="image-20230517011633239"></p>
<h2 id="用例图"><a href="#用例图" class="headerlink" title="用例图"></a>用例图</h2><ul>
<li><p>题干有关项目的描述，写参与者和用例（名称，参与者，角色）</p>
</li>
<li><p><strong>包含关系（include）</strong>：两个用例必然使用关系（登记外借信息 – 用户登录）</p>
</li>
<li><p><strong>扩展关系（extend)</strong>    ：不必须使用第二个用例（查询书籍信息 – 修改书籍信息）</p>
</li>
<li><p><strong>泛化关系</strong></p>
</li>
<li><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517112955425.png" alt="image-20230517112955425"></p>
</li>
</ul>
<h2 id="类图与对象"><a href="#类图与对象" class="headerlink" title="类图与对象"></a>类图与对象</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517164137880.png" alt="image-20230517164137880"></p>
<ul>
<li><h2 id="填类名，方法名、属性名"><a href="#填类名，方法名、属性名" class="headerlink" title="填类名，方法名、属性名"></a><strong>填类名</strong>，方法名、属性名</h2></li>
<li><h2 id="填多重度"><a href="#填多重度" class="headerlink" title="填多重度"></a><strong>填多重度</strong></h2></li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517164929984.png"></p>
<ul>
<li><p>多重度：一个<strong>书籍列表</strong>对应<strong>0个或多个</strong>书籍</p>
</li>
<li><h2 id="填关系"><a href="#填关系" class="headerlink" title="填关系"></a><strong>填关系</strong></h2></li>
<li><p>重点：范化、组合、聚合、实现关系</p>
</li>
<li><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230525001836450.png" alt="image-20230525001836450"></p>
</li>
<li><p>聚合：聚合进而独立</p>
</li>
<li><p>组合与聚合</p>
</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230525002809823.png" alt="image-20230525002809823"></p>
<ul>
<li>泛化：子类指向父类</li>
<li><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230525002919145.png" alt="image-20230525002919145"></li>
<li>实现</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517165614616.png" alt="image-20230517165614616"></p>
<ul>
<li>包含：包含-》被包含</li>
</ul>
<h2 id="顺序图"><a href="#顺序图" class="headerlink" title="顺序图"></a>顺序图</h2><ul>
<li><p>对象写在顶端，对象引出生命线(虚线)</p>
</li>
<li><p>箭头：向 * 发送  <strong>消息</strong></p>
</li>
<li><p>考点：<strong>消息</strong>，填入某些消息，根据处理流程填入</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517170255844.png" alt="image-20230517170255844"></p>
</li>
</ul>
<h2 id="活动图"><a href="#活动图" class="headerlink" title="活动图"></a>活动图</h2><ul>
<li><p>接近程序流程图</p>
</li>
<li><p>横线：分支、合并</p>
</li>
<li><p>考点：补充完整</p>
</li>
<li><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517170549082.png" alt="image-20230517170549082"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517170514956.png" alt="image-20230517170514956"></p>
</li>
</ul>
<h2 id="状态图"><a href="#状态图" class="headerlink" title="状态图"></a>状态图</h2><ul>
<li><p>状态的变迁–动态图</p>
</li>
<li><p>状态为结点，触发事件</p>
</li>
<li><p>考点：根据系统描述，根据状态的变迁，填入<strong>状态</strong>和状态变迁的<strong>条件</strong></p>
</li>
<li><p>例：会员升级</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517170748895.png" alt="image-20230517170748895"></p>
</li>
</ul>
<h2 id="通信图"><a href="#通信图" class="headerlink" title="通信图"></a>通信图</h2><ul>
<li>协助图、交互图</li>
<li>和顺序图类似，顺序图强调时间顺序</li>
<li>考点：填空题、填对象和传递的消息</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517171247625.png" alt="image-20230517171247625"></p>
<h2 id="案例分析1"><a href="#案例分析1" class="headerlink" title="案例分析1"></a>案例分析1</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517171314425.png" alt="image-20230517171314425"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517172458068.png" alt="image-20230517172458068"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517171500341.png" alt="image-20230517171500341"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517171514898.png" alt="image-20230517171514898"></p>
<ul>
<li>问题1：</li>
</ul>
<p>C:乐队</p>
<p>D：歌手，歌手聚成乐队 – 聚合关系</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517212050308.png" alt="image-20230517212050308"></p>
<ul>
<li>问题2</li>
</ul>
<p>（1）0..*  一名歌手对应0个乐队或者多个乐队</p>
<p>（2）2..* 一个乐队对应两名或多名歌手</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517212705222.png" alt="image-20230517212705222"></p>
<ul>
<li>问题3</li>
</ul>
<p>音轨：对应<strong>上一条</strong>和<strong>下一条</strong></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517213132940.png" alt="image-20230517213132940"></p>
<ul>
<li>问题4</li>
</ul>
<p>按任意键 – 选择歌曲 – 播放</p>
<h2 id="案例分析2"><a href="#案例分析2" class="headerlink" title="案例分析2"></a>案例分析2</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517213535677.png" alt="image-20230517213535677"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517213548510.png" alt="image-20230517213548510"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517213606779.png" alt="image-20230517213606779"></p>
<ul>
<li>问题1</li>
</ul>
<p>S1：普卡会员</p>
<p>S2：银卡会员</p>
<p>S3：金卡会员</p>
<p>T1：2500&lt;&#x3D;里程&lt;50000</p>
<p>T2：里程 &gt;&#x3D; 50000</p>
<p>T3：里程 &gt;&#x3D; 50000</p>
<ul>
<li><p>问题2<img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517214633318.png" alt="image-20230517214633318"></p>
</li>
<li><p>问题3：</p>
<ul>
<li><p>设计模式：状态模式</p>
</li>
<li><p>必须要有的属性：CLevel</p>
</li>
<li><p>计算里程数，判断里程数来计算会员等级</p>
</li>
</ul>
</li>
</ul>
<h1 id="数据结构及算法应用"><a href="#数据结构及算法应用" class="headerlink" title="数据结构及算法应用"></a>数据结构及算法应用</h1><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517215241701.png" alt="image-20230517215241701"></p>
<ul>
<li></li>
</ul>
<h2 id="分治法"><a href="#分治法" class="headerlink" title="分治法"></a>分治法</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517231854288.png" alt="image-20230517231854288"></p>
<h3 id="递归技术"><a href="#递归技术" class="headerlink" title="递归技术"></a>递归技术</h3><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517232648101.png" alt="image-20230517232648101"></p>
<h3 id="二分查找-1"><a href="#二分查找-1" class="headerlink" title="二分查找"></a>二分查找</h3><ul>
<li>L 数列</li>
<li>a:开始下标、b:结束下标、x：查找值</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517233108076.png" alt="image-20230517233108076"></p>
<h2 id="回溯法"><a href="#回溯法" class="headerlink" title="回溯法"></a>回溯法</h2><ul>
<li>深度优先</li>
</ul>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517233709848.png" alt="image-20230517233709848"></p>
<h2 id="贪心法"><a href="#贪心法" class="headerlink" title="贪心法"></a>贪心法</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517233740594.png" alt="image-20230517233740594"></p>
<h2 id="动态规划法"><a href="#动态规划法" class="headerlink" title="动态规划法"></a>动态规划法</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517234216195.png" alt="image-20230517234216195"></p>
<h2 id="试题1-1"><a href="#试题1-1" class="headerlink" title="试题1"></a>试题1</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517234716136.png" alt="image-20230517234716136"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517234732374.png" alt="image-20230517234732374"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517234744443.png" alt=" "></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230517234803538.png" alt="image-20230517234803538"></p>
<p>问题1</p>
<p>(1)	j&#x3D;0</p>
<p>(2)	b[ j ]&#x3D;b[ j ]+s[ i ]</p>
<p>(3)	min &#x3D; temp</p>
<p>(4)	b[m]&#x3D;b[m]+s[i]</p>
<p>问题2</p>
<p>（5）贪心</p>
<p>（6）贪心</p>
<p>（7）O(n*2)</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518001916791.png" alt="image-20230518001916791"></p>
<p>（8）O(n*2)</p>
<p>问题3</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518000807638.png" alt="image-20230518000805549"></p>
<h2 id="试题2-1"><a href="#试题2-1" class="headerlink" title="试题2"></a>试题2</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518104351250.png" alt="image-20230518104351250"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518104439283.png" alt="image-20230518104439283"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518104517805.png" alt="image-20230518104517805"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518104619785.png" alt="image-20230518104619785"></p>
<p>问题（1）</p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518161234770.png" alt="image-20230518161234770"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518161245403.png" alt="image-20230518161245403"></p>
<ul>
<li>问题2</li>
</ul>
<p>（5）分治</p>
<p>（6）递归式：T(n)&#x3D;2T(n&#x2F;2)+O(n)   :子问题为T(n&#x2F;2),两个子问题，归并复杂度为O(n)</p>
<p>（7）时间复杂度：O(nlogn)</p>
<p>（8）空间复杂度（需要多少个交换空间&#x3D;&#x3D;多少个元素）：O(n)</p>
<ul>
<li>问题3</li>
</ul>
<p>（9）n1+n2</p>
<h1 id="面向对象程序设计"><a href="#面向对象程序设计" class="headerlink" title="面向对象程序设计"></a>面向对象程序设计</h1><h2 id="C"><a href="#C" class="headerlink" title="C++"></a>C++</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518162206443.png" alt="image-20230518162206443"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518162313640.png" alt="image-20230518162313640"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518162332742.png" alt="image-20230518162332742"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518163008074.png" alt="image-20230518163008074"></p>
<h2 id="JAVA"><a href="#JAVA" class="headerlink" title="JAVA"></a>JAVA</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518163016353.png" alt="image-20230518163016353"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518163050189.png" alt="image-20230518163050189"></p>
<h2 id="实例1"><a href="#实例1" class="headerlink" title="实例1"></a>实例1</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518163535362.png" alt="image-20230518163535362"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518164052609.png" alt="image-20230518164052609"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518164135633.png" alt="image-20230518164135633"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518164220638.png" alt="image-20230518164220638"></p>
<h2 id="实例2"><a href="#实例2" class="headerlink" title="实例2"></a>实例2</h2><p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518164245481.png" alt="image-20230518164245481"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518164359801.png" alt="image-20230518164359801"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518165226263.png" alt="image-20230518165226263"></p>
<p><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Typro/exam/image-20230518165236568.png" alt="image-20230518165236568"></p>
</article><div class="post-copyright"><div class="post-copyright__author"><span class="post-copyright-meta">文章作者: </span><span class="post-copyright-info"><a href="http://example.com">辰</a></span></div><div class="post-copyright__type"><span class="post-copyright-meta">文章链接: </span><span class="post-copyright-info"><a href="http://example.com/2023/04/11/%E8%BD%AF%E8%80%83/">http://example.com/2023/04/11/%E8%BD%AF%E8%80%83/</a></span></div><div class="post-copyright__notice"><span class="post-copyright-meta">版权声明: </span><span class="post-copyright-info">本博客所有文章除特别声明外，均采用 <a href="https://creativecommons.org/licenses/by-nc-sa/4.0/" target="_blank">CC BY-NC-SA 4.0</a> 许可协议。转载请注明来自 <a href="http://example.com" target="_blank">C·辰</a>！</span></div></div><div class="tag_share"><div class="post-meta__tag-list"><a class="post-meta__tags" href="/tags/Soft-test/">Soft test</a></div><div class="post_share"><div class="social-share" data-image="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog%2Fimages%2Fpage2.jpg" data-sites="wechat,qq"></div><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/butterfly-extsrc/sharejs/dist/css/share.min.css" media="print" onload="this.media='all'"><script src="https://cdn.jsdelivr.net/npm/butterfly-extsrc/sharejs/dist/js/social-share.min.js" defer></script></div></div><nav class="pagination-post" id="pagination"><div class="prev-post pull-left"><a href="/2023/04/06/Java%E5%8F%8D%E5%B0%84/" title="Java反射"><img class="cover" src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog/images/annotayion.webp" onerror="onerror=null;src='/img/404.jpg'" alt="cover of previous post"><div class="pagination-info"><div class="label">上一篇</div><div class="prev_info">Java反射</div></div></a></div><div class="next-post pull-right"><a href="/2023/05/01/Java%E7%BA%BF%E7%A8%8B/" title="Java线程"><img class="cover" src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog/images/thread.webp" onerror="onerror=null;src='/img/404.jpg'" alt="cover of next post"><div class="pagination-info"><div class="label">下一篇</div><div class="next_info">Java线程</div></div></a></div></nav></div><div class="aside-content" id="aside-content"><div class="card-widget card-info"><div class="is-center"><div class="avatar-img"><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog%2Fimages%2Favatar.jpg" onerror="this.onerror=null;this.src='/img/friend_404.gif'" alt="avatar"/></div><div class="author-info__name">辰</div><div class="author-info__description">车遥马慢</div></div><div class="card-info-data site-data is-center"><a href="/archives/"><div class="headline">文章</div><div class="length-num">32</div></a><a href="/tags/"><div class="headline">标签</div><div class="length-num">28</div></a><a href="/categories/"><div class="headline">分类</div><div class="length-num">10</div></a></div><a id="card-info-btn" target="_blank" rel="noopener" href="https://gitee.com/hchenp"><i class="fab fa-github"></i><span>Gitee-HchenP</span></a><div class="card-info-social-icons is-center"><a class="social-icon" href="https://gitee.com/hchenp" target="_blank" title="Github"><i class="fab fa-github"></i></a><a class="social-icon" href="https://github.com/Pxlchen?tab=projects" target="_blank" title="CSDN"><i class="fa fa-book-open"></i></a><a class="social-icon" href="https://console.cloud.tencent.com/cos/bucket?bucket=chen-1317386995&amp;region=ap-guangzhou&amp;isPublic=true" target="_blank" title="QQ"><i class="fab fa-qq"></i></a><a class="social-icon" href="mailto:1107383160@qq.com" target="_blank" title="Email"><i class="fas fa-envelope-open-text"></i></a></div></div><div class="card-widget card-announcement"><div class="item-headline"><i class="fas fa-bullhorn fa-shake"></i><span>公告</span></div><div class="announcement_content">C2C-Blog</div></div><div class="sticky_layout"><div class="card-widget" id="card-toc"><div class="item-headline"><i class="fas fa-stream"></i><span>目录</span><span class="toc-percentage"></span></div><div class="toc-content is-expand"><ol class="toc"><li class="toc-item toc-level-1"><a class="toc-link" href="#%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BB%84%E6%88%90%E4%B8%8E%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84"><span class="toc-number">1.</span> <span class="toc-text">计算机组成与体系结构</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%BF%9B%E5%88%B6"><span class="toc-number">1.1.</span> <span class="toc-text">进制</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E2%91%A0R%E8%BF%9B%E5%88%B6%E8%BD%AC%E5%8D%81%E8%BF%9B%E5%88%B6"><span class="toc-number">1.1.1.</span> <span class="toc-text">①	R进制转十进制</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E2%91%A1-%E5%8D%81%E8%BF%9B%E5%88%B6%E8%BD%ACR%E8%BF%9B%E5%88%B6-%E2%80%93-%E7%9F%AD%E9%99%A4%E6%B3%95"><span class="toc-number">1.1.2.</span> <span class="toc-text">② 十进制转R进制 – 短除法</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E2%91%A2-%E4%BA%8C%E8%BF%9B%E5%88%B6%E8%BD%AC%E5%85%AB%E8%BF%9B%E5%88%B6%E5%92%8C%E5%8D%81%E5%85%AD%E8%BF%9B%E5%88%B6"><span class="toc-number">1.1.3.</span> <span class="toc-text">③ 二进制转八进制和十六进制</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%B5%AE%E7%82%B9%E6%95%B0%E8%BF%90%E7%AE%97"><span class="toc-number">1.2.</span> <span class="toc-text">浮点数运算</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BC%96%E7%A0%81"><span class="toc-number">1.3.</span> <span class="toc-text">编码</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E2%91%A0%E5%8E%9F%E7%A0%81"><span class="toc-number">1.3.1.</span> <span class="toc-text">①原码</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E2%91%A1%E5%8F%8D%E7%A0%81"><span class="toc-number">1.3.2.</span> <span class="toc-text">②反码</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E2%91%A2%E8%A1%A5%E7%A0%81"><span class="toc-number">1.3.3.</span> <span class="toc-text">③补码</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E2%91%A3%E7%A7%BB%E7%A0%81%EF%BC%88%E6%B5%AE%E7%82%B9%E8%BF%90%E7%AE%97%E7%9A%84%E6%8E%A5%E7%A0%81%EF%BC%89"><span class="toc-number">1.3.4.</span> <span class="toc-text">④移码（浮点运算的接码）</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BB%93%E6%9E%84"><span class="toc-number">1.4.</span> <span class="toc-text">计算机结构</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#CISC-%E4%B8%8E-RISC"><span class="toc-number">1.4.1.</span> <span class="toc-text">CISC 与 RISC</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%B5%81%E6%B0%B4%E7%BA%BF"><span class="toc-number">1.4.2.</span> <span class="toc-text">流水线</span></a><ol class="toc-child"><li class="toc-item toc-level-4"><a class="toc-link" href="#%E6%B5%81%E6%B0%B4%E7%BA%BF%E5%91%A8%E6%9C%9F%E3%80%81%E6%89%A7%E8%A1%8C%E6%97%B6%E9%97%B4%E8%AE%A1%E7%AE%97"><span class="toc-number">1.4.2.1.</span> <span class="toc-text">流水线周期、执行时间计算</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E6%B5%81%E6%B0%B4%E7%BA%BF%E5%90%9E%E5%90%90%E9%87%8F%E8%AE%A1%E7%AE%97"><span class="toc-number">1.4.2.2.</span> <span class="toc-text">流水线吞吐量计算</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E6%B5%81%E6%B0%B4%E7%BA%BF%E7%9A%84%E5%8A%A0%E9%80%9F%E6%AF%94%E8%AE%A1%E7%AE%97"><span class="toc-number">1.4.2.3.</span> <span class="toc-text">流水线的加速比计算</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E6%B5%81%E6%B0%B4%E7%BA%BF%E7%9A%84%E6%95%88%E7%8E%87%E8%AE%A1%E7%AE%97"><span class="toc-number">1.4.2.4.</span> <span class="toc-text">流水线的效率计算</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#l"><span class="toc-number">1.4.2.5.</span> <span class="toc-text">             l</span></a></li></ol></li><li class="toc-item toc-level-3"><a class="toc-link" href="#Cache-SRAM"><span class="toc-number">1.4.3.</span> <span class="toc-text">Cache:SRAM</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%B8%AD%E6%96%AD-x2F-I-x2F-O"><span class="toc-number">1.5.</span> <span class="toc-text">中断  &#x2F;  I&#x2F;O</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E5%AD%98%E5%82%A8%E5%99%A8"><span class="toc-number">2.</span> <span class="toc-text">存储器</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#CPU"><span class="toc-number">2.1.</span> <span class="toc-text">CPU</span></a><ol class="toc-child"><li class="toc-item toc-level-4"><a class="toc-link" href="#%E9%9A%8F%E6%9C%BA%E5%AD%98%E5%8F%96%E5%AD%98%E5%82%A8%E5%99%A8"><span class="toc-number">2.1.0.1.</span> <span class="toc-text">随机存取存储器</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E5%8F%AA%E8%AF%BB%E5%AD%98%E5%82%A8%E5%99%A8"><span class="toc-number">2.1.0.2.</span> <span class="toc-text">只读存储器</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E7%BC%96%E5%9D%80"><span class="toc-number">2.1.0.3.</span> <span class="toc-text">编址</span></a></li></ol></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%A3%81%E7%9B%98"><span class="toc-number">2.1.1.</span> <span class="toc-text">磁盘</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%80%BB%E7%BA%BF"><span class="toc-number">2.1.2.</span> <span class="toc-text">总线</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%B3%BB%E7%BB%9F%E5%8F%AF%E9%9D%A0%E6%80%A7%E5%88%86%E6%9E%90"><span class="toc-number">2.1.3.</span> <span class="toc-text">系统可靠性分析</span></a><ol class="toc-child"><li class="toc-item toc-level-4"><a class="toc-link" href="#%E4%B8%B2%E8%81%94%E7%B3%BB%E7%BB%9F"><span class="toc-number">2.1.3.1.</span> <span class="toc-text">串联系统</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E5%B9%B6%E8%81%94%E7%B3%BB%E7%BB%9F"><span class="toc-number">2.1.3.2.</span> <span class="toc-text">并联系统</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#n%E6%A8%A1%E5%86%97%E4%BD%99%E7%B3%BB%E7%BB%9F"><span class="toc-number">2.1.3.3.</span> <span class="toc-text">n模冗余系统</span></a></li></ol></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%B7%AE%E9%94%99%E6%8E%A7%E5%88%B6"><span class="toc-number">2.1.4.</span> <span class="toc-text">差错控制</span></a><ol class="toc-child"><li class="toc-item toc-level-4"><a class="toc-link" href="#CRC%E5%BE%AA%E7%8E%AF%E6%A0%A1%E9%AA%8C%E7%A0%81%E2%80%93%E5%8F%AA%E8%83%BD%E6%A3%80%E9%94%99"><span class="toc-number">2.1.4.1.</span> <span class="toc-text">CRC循环校验码–只能检错</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E5%A5%87%E5%81%B6%E6%A0%A1%E9%AA%8C"><span class="toc-number">2.1.4.2.</span> <span class="toc-text">奇偶校验</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E6%B5%B7%E6%98%8E%E6%A0%A1%E9%AA%8C%E7%A0%81"><span class="toc-number">2.1.4.3.</span> <span class="toc-text">海明校验码</span></a></li></ol></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F"><span class="toc-number">3.</span> <span class="toc-text">操作系统</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%BF%9B%E7%A8%8B%E7%AE%A1%E7%90%86"><span class="toc-number">3.1.</span> <span class="toc-text">进程管理</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E8%BF%9B%E7%A8%8B%E7%9A%84%E7%8A%B6%E6%80%81"><span class="toc-number">3.1.1.</span> <span class="toc-text">进程的状态</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%89%8D%E8%B6%8B%E5%9B%BE"><span class="toc-number">3.1.2.</span> <span class="toc-text">前趋图</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#PV%E6%93%8D%E4%BD%9C"><span class="toc-number">3.1.3.</span> <span class="toc-text">PV操作</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%AD%BB%E9%94%81%E9%97%AE%E9%A2%98"><span class="toc-number">3.1.4.</span> <span class="toc-text">死锁问题</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AD%98%E5%82%A8%E7%AE%A1%E7%90%86"><span class="toc-number">3.2.</span> <span class="toc-text">存储管理</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%88%86%E5%8C%BA%E5%AD%98%E5%82%A8%E7%BB%84%E7%BB%87"><span class="toc-number">3.2.1.</span> <span class="toc-text">分区存储组织</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%A1%B5%E5%BC%8F%E5%AD%98%E5%82%A8%E7%BB%84%E7%BB%87"><span class="toc-number">3.2.2.</span> <span class="toc-text">页式存储组织</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%AE%B5%E5%BC%8F%E5%AD%98%E5%82%A8%E7%BB%84%E7%BB%87%EF%BC%88%E9%80%BB%E8%BE%91%E7%BB%93%E6%9E%84%E5%88%92%E5%88%86%EF%BC%89"><span class="toc-number">3.2.3.</span> <span class="toc-text">段式存储组织（逻辑结构划分）</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%AE%B5%E9%A1%B5%E5%AD%98%E5%82%A8%E7%BB%84%E7%BB%87"><span class="toc-number">3.2.4.</span> <span class="toc-text">段页存储组织</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%BF%AB%E8%A1%A8"><span class="toc-number">3.2.5.</span> <span class="toc-text">快表</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%A1%B5%E9%9D%A2%E7%BD%AE%E6%8D%A2%E7%AE%97%E6%B3%95"><span class="toc-number">3.2.6.</span> <span class="toc-text">页面置换算法</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%96%87%E4%BB%B6%E7%AE%A1%E7%90%86"><span class="toc-number">3.3.</span> <span class="toc-text">文件管理</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%B4%A2%E5%BC%95%E6%96%87%E4%BB%B6%E7%BB%93%E6%9E%84"><span class="toc-number">3.3.1.</span> <span class="toc-text">索引文件结构</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%96%87%E4%BB%B6%E5%92%8C%E6%A0%91%E5%9E%8B%E7%9B%AE%E5%BD%95%E7%BB%93%E6%9E%84"><span class="toc-number">3.3.2.</span> <span class="toc-text">文件和树型目录结构</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%A9%BA%E9%97%B2%E5%AD%98%E5%82%A8%E7%A9%BA%E9%97%B4%E7%9A%84%E7%AE%A1%E7%90%86"><span class="toc-number">3.3.3.</span> <span class="toc-text">空闲存储空间的管理</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E4%BC%A0%E8%BE%93%E6%8E%A7%E5%88%B6%E6%96%B9%E5%BC%8F"><span class="toc-number">3.3.4.</span> <span class="toc-text">数据传输控制方式</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E8%99%9A%E8%AE%BE%E5%A4%87%E4%B8%8ESPOOLING%E6%8A%80%E6%9C%AF"><span class="toc-number">3.3.5.</span> <span class="toc-text">虚设备与SPOOLING技术</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%BE%AE%E5%86%85%E6%A0%B8%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F"><span class="toc-number">3.3.6.</span> <span class="toc-text">微内核操作系统</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F"><span class="toc-number">4.</span> <span class="toc-text">数据库系统</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%B8%89%E7%BA%A7%E6%A8%A1%E5%BC%8F"><span class="toc-number">4.1.</span> <span class="toc-text">三级模式</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%B8%A4%E7%BA%A7%E6%98%A0%E5%B0%84"><span class="toc-number">4.2.</span> <span class="toc-text">两级映射</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AE%8C%E6%95%B4%E6%80%A7"><span class="toc-number">4.3.</span> <span class="toc-text">完整性</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E5%BA%93%E8%AE%BE%E8%AE%A1%E8%BF%87%E7%A8%8B"><span class="toc-number">4.4.</span> <span class="toc-text">数据库设计过程</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#E-R%E6%A8%A1%E5%9E%8B"><span class="toc-number">4.5.</span> <span class="toc-text">E-R模型</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%85%B3%E7%B3%BB%E4%BB%A3%E6%95%B0"><span class="toc-number">4.6.</span> <span class="toc-text">关系代数</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%A7%84%E8%8C%83%E5%8C%96%E7%90%86%E8%AE%BA"><span class="toc-number">4.7.</span> <span class="toc-text">规范化理论</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%87%BD%E6%95%B0%E4%BE%9D%E8%B5%96"><span class="toc-number">4.7.1.</span> <span class="toc-text">函数依赖</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E4%BB%B7%E5%80%BC%E4%B8%8E%E7%94%A8%E9%80%94"><span class="toc-number">4.7.2.</span> <span class="toc-text">价值与用途</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%94%AE"><span class="toc-number">4.7.3.</span> <span class="toc-text">键</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E8%8C%83%E5%BC%8F"><span class="toc-number">4.7.4.</span> <span class="toc-text">范式</span></a><ol class="toc-child"><li class="toc-item toc-level-4"><a class="toc-link" href="#%E7%AC%AC%E4%B8%80%E8%8C%83%E5%BC%8F%EF%BC%881NF%EF%BC%89"><span class="toc-number">4.7.4.1.</span> <span class="toc-text">第一范式（1NF）</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E7%AC%AC%E4%BA%8C%E8%8C%83%E5%BC%8F%EF%BC%882NF%EF%BC%89"><span class="toc-number">4.7.4.2.</span> <span class="toc-text">第二范式（2NF）</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#%E7%AC%AC%E4%B8%89%E8%8C%83%E5%BC%8F%EF%BC%883NF%EF%BC%89"><span class="toc-number">4.7.4.3.</span> <span class="toc-text">第三范式（3NF）</span></a></li><li class="toc-item toc-level-4"><a class="toc-link" href="#BC%E8%8C%83%E5%BC%8F"><span class="toc-number">4.7.4.4.</span> <span class="toc-text">BC范式</span></a></li></ol></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%A8%A1%E5%BC%8F%E5%88%86%E8%A7%A3"><span class="toc-number">4.7.5.</span> <span class="toc-text">模式分解</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%B9%B6%E5%8F%91%E6%8E%A7%E5%88%B6"><span class="toc-number">4.7.6.</span> <span class="toc-text">并发控制</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%AE%8C%E6%95%B4%E6%80%A7%E7%BA%A6%E6%9D%9F"><span class="toc-number">4.7.7.</span> <span class="toc-text">完整性约束</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E5%BA%93%E5%AE%89%E5%85%A8"><span class="toc-number">4.7.8.</span> <span class="toc-text">数据库安全</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E5%A4%87%E4%BB%BD"><span class="toc-number">4.7.9.</span> <span class="toc-text">数据备份</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E4%BB%93%E5%BA%93%E4%B8%8E%E6%95%B0%E6%8D%AE%E6%8C%96%E6%8E%98"><span class="toc-number">4.7.10.</span> <span class="toc-text">数据仓库与数据挖掘</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%8F%8D%E8%A7%84%E8%8C%83%E5%8C%96"><span class="toc-number">4.8.</span> <span class="toc-text">反规范化</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%A4%A7%E6%95%B0%E6%8D%AE"><span class="toc-number">4.8.1.</span> <span class="toc-text">大数据</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C"><span class="toc-number">5.</span> <span class="toc-text">计算机网络</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#OSI-x2F-RM%E4%B8%83%E5%B1%82%E6%A8%A1%E5%9E%8B"><span class="toc-number">5.1.</span> <span class="toc-text">OSI&#x2F;RM七层模型</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BD%91%E7%BB%9C%E6%8A%80%E6%9C%AF%E6%A0%87%E5%87%86%E4%B8%8E%E5%8D%8F%E8%AE%AE"><span class="toc-number">5.2.</span> <span class="toc-text">网络技术标准与协议</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#TCP%E5%8D%8F%E8%AE%AE"><span class="toc-number">5.2.1.</span> <span class="toc-text">TCP协议</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#DHCP%E5%8D%8F%E8%AE%AE"><span class="toc-number">5.2.2.</span> <span class="toc-text">DHCP协议</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#DNS%E5%8D%8F%E8%AE%AE"><span class="toc-number">5.2.3.</span> <span class="toc-text">DNS协议</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%8B%93%E6%89%91%E7%BB%93%E6%9E%84"><span class="toc-number">5.3.</span> <span class="toc-text">拓扑结构</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BD%91%E7%BB%9C%E8%A7%84%E5%88%92%E4%B8%8E%E8%AE%BE%E8%AE%A1"><span class="toc-number">5.4.</span> <span class="toc-text">网络规划与设计</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%80%BB%E8%BE%91%E7%BD%91%E7%BB%9C%E8%AE%BE%E8%AE%A1"><span class="toc-number">5.4.1.</span> <span class="toc-text">逻辑网络设计</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%89%A9%E7%90%86%E7%BD%91%E7%BB%9C%E8%AE%BE%E8%AE%A1"><span class="toc-number">5.4.2.</span> <span class="toc-text">物理网络设计</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%88%86%E5%B1%82%E8%AE%BE%E8%AE%A1"><span class="toc-number">5.4.3.</span> <span class="toc-text">分层设计</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#IP%E5%9C%B0%E5%9D%80"><span class="toc-number">5.5.</span> <span class="toc-text">IP地址</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AD%90%E7%BD%91%E5%88%92%E5%88%86"><span class="toc-number">5.6.</span> <span class="toc-text">子网划分</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AD%90%E7%BD%91%E6%8E%A9%E7%A0%81"><span class="toc-number">5.7.</span> <span class="toc-text">子网掩码</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%97%A0%E5%88%86%E7%B1%BB%E7%BC%96%E5%9D%80"><span class="toc-number">5.8.</span> <span class="toc-text">无分类编址</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%89%B9%E6%AE%8A%E5%90%AB%E4%B9%89%E7%9A%84IP%E5%9C%B0%E5%9D%80"><span class="toc-number">5.9.</span> <span class="toc-text">特殊含义的IP地址</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%97%A0%E7%BA%BF%E7%BD%91"><span class="toc-number">5.10.</span> <span class="toc-text">无线网</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BD%91%E7%BB%9C%E6%8E%A5%E5%85%A5%E6%8A%80%E6%9C%AF"><span class="toc-number">5.11.</span> <span class="toc-text">网络接入技术</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#IPV6"><span class="toc-number">5.12.</span> <span class="toc-text">IPV6</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8%E5%88%86%E6%9E%90%E4%B8%8E%E8%AE%BE%E8%AE%A1"><span class="toc-number">6.</span> <span class="toc-text">系统安全分析与设计</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%BF%A1%E6%81%AF%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8%E5%B1%9E%E6%80%A7"><span class="toc-number">6.1.</span> <span class="toc-text">信息系统安全属性</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AF%B9%E6%AD%A4%E5%8A%A0%E5%AF%86%E6%8A%80%E6%9C%AF"><span class="toc-number">6.2.</span> <span class="toc-text">对此加密技术</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%9D%9E%E5%AF%B9%E7%A7%B0%E5%8A%A0%E5%AF%86%E6%8A%80%E6%9C%AF"><span class="toc-number">6.3.</span> <span class="toc-text">非对称加密技术</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%BF%A1%E6%81%AF%E6%91%98%E8%A6%81"><span class="toc-number">6.4.</span> <span class="toc-text">信息摘要</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%95%B0%E5%AD%97%E7%AD%BE%E5%90%8D"><span class="toc-number">6.5.</span> <span class="toc-text">数字签名</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%95%B0%E5%AD%97%E4%BF%A1%E5%B0%81%E4%B8%8EPGP"><span class="toc-number">6.6.</span> <span class="toc-text">数字信封与PGP</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BB%83%E4%B9%A0%E9%A2%98-%E8%AE%BE%E8%AE%A1%E9%82%AE%E4%BB%B6%E5%8A%A0%E5%AF%86%E7%B3%BB%E7%BB%9F"><span class="toc-number">6.7.</span> <span class="toc-text">练习题  -  设计邮件加密系统</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%8A%A0%E5%AF%86%E7%AE%97%E6%B3%95"><span class="toc-number">6.8.</span> <span class="toc-text">加密算法</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BD%91%E7%BB%9C%E5%AE%89%E5%85%A8-%E2%80%93-%E5%90%84%E4%B8%AA%E7%BD%91%E7%BB%9C%E5%B1%82%E6%AC%A1%E7%9A%84%E5%AE%89%E5%85%A8%E4%BF%9D%E9%9A%9C"><span class="toc-number">6.9.</span> <span class="toc-text">网络安全  –  各个网络层次的安全保障</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BD%91%E7%BB%9C%E5%AE%89%E5%85%A8-%E2%80%93-%E7%BD%91%E7%BB%9C%E5%A8%81%E8%83%81%E4%B8%8E%E6%94%BB%E5%87%BB"><span class="toc-number">6.10.</span> <span class="toc-text">网络安全  –  网络威胁与攻击</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BD%91%E7%BB%9C%E5%AE%89%E5%85%A8-%E2%80%93-%E9%98%B2%E7%81%AB%E5%A2%99"><span class="toc-number">6.11.</span> <span class="toc-text">网络安全  –  防火墙</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84"><span class="toc-number">7.</span> <span class="toc-text">数据结构</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%95%B0%E7%BB%84"><span class="toc-number">7.1.</span> <span class="toc-text">数组</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%A8%80%E7%96%8F%E7%9F%A9%E9%98%B5"><span class="toc-number">7.2.</span> <span class="toc-text">稀疏矩阵</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E7%9A%84%E5%AE%9A%E4%B9%89"><span class="toc-number">7.3.</span> <span class="toc-text">数据结构的定义</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BA%BF%E6%80%A7%E8%A1%A8"><span class="toc-number">7.4.</span> <span class="toc-text">线性表</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%A1%BA%E5%BA%8F%E5%AD%98%E5%82%A8%E4%B8%8E%E9%93%BE%E5%BC%8F%E5%AD%98%E5%82%A8%E5%AF%B9%E6%AF%94"><span class="toc-number">7.4.1.</span> <span class="toc-text">顺序存储与链式存储对比</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%98%9F%E5%88%97%E4%B8%8E%E6%A0%88"><span class="toc-number">7.4.2.</span> <span class="toc-text">队列与栈</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%B9%BF%E4%B9%89%E8%A1%A8"><span class="toc-number">7.5.</span> <span class="toc-text">广义表</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%A0%91%E4%B8%8E%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="toc-number">7.6.</span> <span class="toc-text">树与二叉树</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%AE%8C%E5%85%A8%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="toc-number">7.6.1.</span> <span class="toc-text">完全二叉树</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E4%BA%8C%E5%8F%89%E6%A0%91%E9%81%8D%E5%8E%86"><span class="toc-number">7.6.2.</span> <span class="toc-text">二叉树遍历</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%8F%8D%E5%90%91%E6%9E%84%E9%80%A0%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="toc-number">7.6.3.</span> <span class="toc-text">反向构造二叉树</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%A0%91%E8%BD%AC%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="toc-number">7.6.4.</span> <span class="toc-text">树转二叉树</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%9F%A5%E6%89%BE%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="toc-number">7.6.5.</span> <span class="toc-text">查找二叉树</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%9C%80%E4%BC%98%E4%BA%8C%E5%8F%89%E6%A0%91%EF%BC%88%E5%93%88%E5%A4%AB%E6%9B%BC%E6%A0%91%EF%BC%89"><span class="toc-number">7.6.6.</span> <span class="toc-text">最优二叉树（哈夫曼树）</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%BA%BF%E7%B4%A2%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="toc-number">7.6.7.</span> <span class="toc-text">线索二叉树</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%B9%B3%E8%A1%A1%E4%BA%8C%E5%8F%89%E6%A0%91"><span class="toc-number">7.6.8.</span> <span class="toc-text">平衡二叉树</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%9B%BE"><span class="toc-number">7.7.</span> <span class="toc-text">图</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%9B%BE%E7%9A%84%E5%AD%98%E5%82%A8"><span class="toc-number">7.8.</span> <span class="toc-text">图的存储</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%82%BB%E6%8E%A5%E7%9F%A9%E9%98%B5"><span class="toc-number">7.8.1.</span> <span class="toc-text">邻接矩阵</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%82%BB%E6%8E%A5%E8%A1%A8"><span class="toc-number">7.8.2.</span> <span class="toc-text">邻接表</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%9B%BE%E7%9A%84%E9%81%8D%E5%8E%86"><span class="toc-number">7.9.</span> <span class="toc-text">图的遍历</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%8B%93%E6%89%91%E6%8E%92%E5%BA%8F"><span class="toc-number">7.10.</span> <span class="toc-text">拓扑排序</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%9B%BE%E7%9A%84%E6%9C%80%E5%B0%8F%E7%94%9F%E6%88%90%E6%A0%91"><span class="toc-number">7.11.</span> <span class="toc-text">图的最小生成树</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%99%AE%E9%87%8C%E5%A7%86%E7%AE%97%E6%B3%95"><span class="toc-number">7.11.1.</span> <span class="toc-text">普里姆算法</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%85%8B%E9%B2%81%E6%96%AF%E5%8D%A1%E5%B0%94%E7%AE%97%E6%B3%95"><span class="toc-number">7.11.2.</span> <span class="toc-text">克鲁斯卡尔算法</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E7%AE%97%E6%B3%95"><span class="toc-number">8.</span> <span class="toc-text">算法</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%AE%97%E6%B3%95%E7%9A%84%E7%89%B9%E6%80%A7"><span class="toc-number">8.1.</span> <span class="toc-text">算法的特性</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%AE%97%E6%B3%95%E7%9A%84%E5%A4%8D%E6%9D%82%E5%BA%A6"><span class="toc-number">8.2.</span> <span class="toc-text">算法的复杂度</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6-%E2%80%93-%E8%80%83%E8%AF%95%E9%A2%91%E7%8E%87%E9%AB%98"><span class="toc-number">8.2.1.</span> <span class="toc-text">时间复杂度  – 考试频率高</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%A9%BA%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6"><span class="toc-number">8.2.2.</span> <span class="toc-text">空间复杂度</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%9F%A5%E6%89%BE"><span class="toc-number">8.3.</span> <span class="toc-text">查找</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%A1%BA%E5%BA%8F%E6%9F%A5%E6%89%BE"><span class="toc-number">8.3.1.</span> <span class="toc-text">顺序查找</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE"><span class="toc-number">8.3.2.</span> <span class="toc-text">二分查找</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%9F%A5%E6%89%BE-%E6%95%A3%E5%88%97%E8%A1%A8"><span class="toc-number">8.3.3.</span> <span class="toc-text">查找-散列表</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.</span> <span class="toc-text">排序</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%9B%B4%E6%8E%A5%E6%8F%92%E5%85%A5%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.1.</span> <span class="toc-text">直接插入排序</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%B8%8C%E5%B0%94%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.2.</span> <span class="toc-text">希尔排序</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%9B%B4%E6%8E%A5%E9%80%89%E6%8B%A9%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.3.</span> <span class="toc-text">直接选择排序</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%A0%86%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.4.</span> <span class="toc-text">堆排序</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%86%92%E6%B3%A1%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.5.</span> <span class="toc-text">冒泡排序</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.6.</span> <span class="toc-text">快速排序</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%BD%92%E5%B9%B6%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.7.</span> <span class="toc-text">归并排序</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%9F%BA%E6%95%B0%E6%8E%92%E5%BA%8F"><span class="toc-number">8.4.8.</span> <span class="toc-text">基数排序</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1%E8%AF%AD%E8%A8%80%E4%B8%8E%E8%AF%AD%E8%A8%80%E5%A4%84%E7%90%86%E7%A8%8B%E5%BA%8F%E5%9F%BA%E7%A1%80"><span class="toc-number">9.</span> <span class="toc-text">*程序设计语言与语言处理程序基础</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BC%96%E8%AF%91%E8%BF%87%E7%A8%8B"><span class="toc-number">9.1.</span> <span class="toc-text">编译过程</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%96%87%E6%B3%95%E5%AE%9A%E4%B9%89"><span class="toc-number">9.2.</span> <span class="toc-text">文法定义</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AF%AD%E6%B3%95%E6%8E%A8%E5%AF%BC%E6%A0%91"><span class="toc-number">9.3.</span> <span class="toc-text">语法推导树</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%9C%89%E9%99%90%E8%87%AA%E5%8A%A8%E6%9C%BA"><span class="toc-number">9.4.</span> <span class="toc-text">有限自动机</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%AD%A3%E8%A7%84%E5%BC%8F"><span class="toc-number">9.5.</span> <span class="toc-text">正规式</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%A1%A8%E8%BE%BE%E5%BC%8F"><span class="toc-number">9.6.</span> <span class="toc-text">表达式</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%BC%A0%E5%80%BC%E5%92%8C%E4%BC%A0%E5%9D%80"><span class="toc-number">9.7.</span> <span class="toc-text">传值和传址</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%90%84%E7%A8%8B%E5%BA%8F%E8%AF%AD%E8%A8%80%E7%89%B9%E7%82%B9"><span class="toc-number">9.8.</span> <span class="toc-text">各程序语言特点</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%B8%AD%E9%97%B4%E4%BB%A3%E7%A0%81"><span class="toc-number">9.9.</span> <span class="toc-text">中间代码</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%B3%95%E5%BE%8B%E6%B3%95%E8%A7%84"><span class="toc-number">10.</span> <span class="toc-text">法律法规</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%BF%9D%E6%8A%A4%E6%9C%9F%E9%99%90"><span class="toc-number">10.1.</span> <span class="toc-text">保护期限</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%9F%A5%E8%AF%86%E4%BA%A7%E6%9D%83%E4%BA%BA%E7%A1%AE%E5%AE%9A"><span class="toc-number">10.2.</span> <span class="toc-text">知识产权人确定</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%BE%B5%E6%9D%83%E5%88%A4%E5%AE%9A"><span class="toc-number">10.3.</span> <span class="toc-text">侵权判定</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%A0%87%E5%87%86%E5%8C%96"><span class="toc-number">11.</span> <span class="toc-text">标准化</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%A1%A8%E5%87%86%E7%9A%84%E5%88%86%E7%B1%BB"><span class="toc-number">11.1.</span> <span class="toc-text">表准的分类</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%A0%87%E5%87%86%E7%9A%84%E7%BC%96%E5%8F%B7"><span class="toc-number">11.2.</span> <span class="toc-text">标准的编号</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E5%A4%9A%E5%AA%92%E4%BD%93%E5%9F%BA%E7%A1%80"><span class="toc-number">12.</span> <span class="toc-text">多媒体基础</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%9F%B3%E9%A2%91"><span class="toc-number">12.1.</span> <span class="toc-text">音频</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%9B%BE%E5%83%8F"><span class="toc-number">12.2.</span> <span class="toc-text">图像</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AA%92%E4%BD%93%E7%A7%8D%E7%B1%BB"><span class="toc-number">12.3.</span> <span class="toc-text">媒体种类</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%A4%9A%E5%AA%92%E4%BD%93%E7%9B%B8%E5%85%B3%E8%AE%A1%E7%AE%97"><span class="toc-number">12.4.</span> <span class="toc-text">多媒体相关计算</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%B8%B8%E8%A7%81%E5%A4%9A%E5%AA%92%E4%BD%93%E6%A0%87%E5%87%86"><span class="toc-number">12.5.</span> <span class="toc-text">常见多媒体标准</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E5%8E%8B%E7%BC%A9%E5%9F%BA%E7%A1%80"><span class="toc-number">12.6.</span> <span class="toc-text">数据压缩基础</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%9C%89%E6%8D%9F%E5%8E%8B%E7%BC%A9%E4%B8%8E%E6%97%A0%E6%8D%9F%E5%8E%8B%E7%BC%A9"><span class="toc-number">12.7.</span> <span class="toc-text">有损压缩与无损压缩</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B"><span class="toc-number">13.</span> <span class="toc-text">软件工程</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%BC%80%E5%8F%91%E6%A8%A1%E5%9E%8B"><span class="toc-number">13.1.</span> <span class="toc-text">开发模型</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%80%91%E5%B8%83%E6%A8%A1%E5%9E%8B"><span class="toc-number">13.1.1.</span> <span class="toc-text">瀑布模型</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%A2%9E%E9%87%8F%E6%A8%A1%E5%9E%8B%E4%B8%8E%E8%9E%BA%E6%97%8B%E6%A8%A1%E5%9E%8B"><span class="toc-number">13.1.2.</span> <span class="toc-text">增量模型与螺旋模型</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%85%B6%E4%BB%96%E7%BB%8F%E5%85%B8%E6%A8%A1%E5%9E%8B"><span class="toc-number">13.1.3.</span> <span class="toc-text">其他经典模型</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%9E%84%E5%BB%BA%E7%BB%84%E6%A8%A1%E5%9E%8B-CBSD"><span class="toc-number">13.1.4.</span> <span class="toc-text">构建组模型(CBSD)</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%BB%9F%E4%B8%80%E8%BF%87%E7%A8%8BUP"><span class="toc-number">13.1.5.</span> <span class="toc-text">统一过程UP</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%95%8F%E6%8D%B7%E5%BC%80%E5%8F%91%E6%96%B9%E6%B3%95"><span class="toc-number">13.1.6.</span> <span class="toc-text">敏捷开发方法</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%BF%A1%E6%81%AF%E7%B3%BB%E7%BB%9F%E5%BC%80%E5%8F%91%E6%96%B9%E6%B3%95"><span class="toc-number">13.2.</span> <span class="toc-text">信息系统开发方法</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%9C%80%E6%B1%82%E5%BC%80%E5%8F%91-%E9%9C%80%E6%B1%82%E5%88%86%E7%B1%BB%E4%B8%8E%E9%9C%80%E6%B1%82%E8%8E%B7%E5%8F%96"><span class="toc-number">13.3.</span> <span class="toc-text">需求开发 - 需求分类与需求获取</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BB%93%E6%9E%84%E5%8C%96%E8%AE%BE%E8%AE%A1"><span class="toc-number">13.4.</span> <span class="toc-text">结构化设计</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%9F%BA%E6%9C%AC%E5%8E%9F%E5%88%99"><span class="toc-number">13.4.1.</span> <span class="toc-text">基本原则</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%86%85%E8%81%9A%E5%92%8C%E8%80%A6%E5%90%88"><span class="toc-number">13.4.2.</span> <span class="toc-text">内聚和耦合</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%B3%BB%E7%BB%9F%E7%BB%93%E6%9E%84-x2F-%E6%A8%A1%E5%9D%97%E7%BB%93%E6%9E%84"><span class="toc-number">13.4.3.</span> <span class="toc-text">系统结构&#x2F;模块结构</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E8%BD%AF%E4%BB%B6%E6%B5%8B%E8%AF%95"><span class="toc-number">14.</span> <span class="toc-text">软件测试</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%B5%8B%E8%AF%95%E5%8E%9F%E5%88%99%E4%B8%8E%E7%B1%BB%E5%9E%8B"><span class="toc-number">14.1.</span> <span class="toc-text">测试原则与类型</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%B5%8B%E8%AF%95%E7%94%A8%E4%BE%8B%E8%AE%BE%E8%AE%A1"><span class="toc-number">14.2.</span> <span class="toc-text">测试用例设计</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%B5%8B%E8%AF%95%E9%98%B6%E6%AE%B5"><span class="toc-number">14.3.</span> <span class="toc-text">测试阶段</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#McCabe%E5%A4%8D%E6%9D%82%E5%BA%A6"><span class="toc-number">14.4.</span> <span class="toc-text">McCabe复杂度</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#CMMI"><span class="toc-number">14.5.</span> <span class="toc-text">CMMI</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E9%A1%B9%E7%9B%AE%E7%AE%A1%E7%90%86"><span class="toc-number">15.</span> <span class="toc-text">项目管理</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%97%B6%E9%97%B4%E7%AE%A1%E7%90%86"><span class="toc-number">15.1.</span> <span class="toc-text">时间管理</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%A3%8E%E9%99%A9%E7%AE%A1%E7%90%86"><span class="toc-number">15.2.</span> <span class="toc-text">风险管理</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E9%9D%A2%E5%90%91%E5%AF%B9%E8%B1%A1%E8%AE%BE%E8%AE%A1"><span class="toc-number">16.</span> <span class="toc-text">面向对象设计</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%9C%80%E6%B1%82%E5%B7%A5%E7%A8%8B"><span class="toc-number">16.1.</span> <span class="toc-text">需求工程</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AE%BE%E8%AE%A1%E5%8E%9F%E5%88%99"><span class="toc-number">16.2.</span> <span class="toc-text">设计原则</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#UML"><span class="toc-number">16.3.</span> <span class="toc-text">UML</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AE%BE%E8%AE%A1%E6%A8%A1%E5%BC%8F%E7%9A%84%E6%A6%82%E5%BF%B5"><span class="toc-number">16.4.</span> <span class="toc-text">设计模式的概念</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AE%BE%E8%AE%A1%E6%A8%A1%E5%BC%8F%E7%9A%84%E5%88%86%E7%B1%BB"><span class="toc-number">16.5.</span> <span class="toc-text">设计模式的分类</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%88%9B%E5%BB%BA%E5%9E%8B%E6%A8%A1%E5%BC%8F"><span class="toc-number">16.6.</span> <span class="toc-text">创建型模式</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%BB%93%E6%9E%84%E5%9E%8B%E6%A8%A1%E5%BC%8F"><span class="toc-number">16.7.</span> <span class="toc-text">结构型模式</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%A1%8C%E4%B8%BA%E5%9E%8B%E6%A8%A1%E5%BC%8F"><span class="toc-number">16.8.</span> <span class="toc-text">行为型模式</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E6%B5%81%E5%9B%BE-DFD"><span class="toc-number">16.9.</span> <span class="toc-text">数据流图(DFD)</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E4%B8%8B%E5%8D%88%E9%A2%981"><span class="toc-number">16.10.</span> <span class="toc-text">下午题1</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%AD%98%E5%82%A8%E9%A2%98%E7%9B%AE%E6%B2%A1%E6%9C%89%E5%90%8D%E5%AD%97%EF%BC%8C%E6%A0%B9%E6%8D%AE%E6%95%B0%E6%8D%AE%E6%B5%81%E5%90%8D%E7%A7%B0-%E8%A1%A8%EF%BC%8C%E8%87%AA%E6%8B%9F"><span class="toc-number">16.10.1.</span> <span class="toc-text">存储题目没有名字，根据数据流名称+表，自拟</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%9F%BA%E6%9C%AC%E6%A6%82%E5%BF%B5"><span class="toc-number">16.10.2.</span> <span class="toc-text">基本概念</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E5%AD%97%E5%85%B8"><span class="toc-number">16.10.3.</span> <span class="toc-text">数据字典</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E6%B5%81%E5%9B%BE%E5%B9%B3%E8%A1%A1%E5%8E%9F%E5%88%99"><span class="toc-number">16.10.4.</span> <span class="toc-text">数据流图平衡原则</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%88%B6%E5%9B%BE%E5%92%8C%E5%AD%90%E5%9B%BE%E4%B9%8B%E9%97%B4%E7%9A%84%E5%B9%B3%E8%A1%A1"><span class="toc-number">16.10.5.</span> <span class="toc-text">父图和子图之间的平衡</span></a></li></ol></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#1%E3%80%81%E7%88%B6%E5%9B%BE%E5%AD%90%E5%9B%BE%E5%B9%B3%E8%A1%A1"><span class="toc-number">17.</span> <span class="toc-text">1、父图子图平衡</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#2%E3%80%81%E5%8A%A0%E5%B7%A5%E6%97%A2%E6%9C%89%E8%BE%93%E5%85%A5%E6%B5%81%E4%B9%9F%E8%A6%81%E6%9C%89%E8%BE%93%E5%87%BA%E6%B5%81%EF%BC%9A%E5%8A%A0%E5%B7%A5%E8%87%B3%E5%B0%91%E6%9C%89%E4%B8%80%E6%9D%A1%E8%BE%93%E5%85%A5%E5%92%8C%E8%BE%93%E5%87%BA%E6%B5%81%EF%BC%8C%E5%8F%AA%E6%9C%89%E8%BE%93%E5%85%A5%E6%97%A0%E8%BE%93%E5%87%BA-gt-%E9%BB%91%E6%B4%9E-%E5%8F%AA%E6%9C%89%E8%BE%93%E5%87%BA%E6%97%A0%E8%BE%93%E5%85%A5-gt-%E5%A5%87%E8%BF%B9"><span class="toc-number">18.</span> <span class="toc-text">2、加工既有输入流也要有输出流：加工至少有一条输入和输出流，只有输入无输出  -&gt;  黑洞     只有输出无输入  -&gt;  奇迹</span></a></li><li class="toc-item toc-level-1"><a class="toc-link" href="#3%E3%80%81%E6%95%B0%E6%8D%AE%E5%AE%88%E6%81%92%EF%BC%9A%E9%A2%98%E7%9B%AE%E7%9A%84%E7%94%9F%E6%88%90%E6%A0%87%E9%A2%98%E5%AF%B9%E5%BA%94%E5%A4%9A%E5%B0%91%E4%B8%AA%E5%8A%A0%E5%B7%A5%E6%95%B0%E9%87%8F"><span class="toc-number">19.</span> <span class="toc-text">3、数据守恒：题目的生成标题对应多少个加工数量</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E7%AD%94%E9%A2%98%E6%8A%80%E5%B7%A7"><span class="toc-number">19.0.1.</span> <span class="toc-text">答题技巧</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AF%95%E9%A2%981"><span class="toc-number">19.1.</span> <span class="toc-text">试题1</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AF%95%E9%A2%982"><span class="toc-number">19.2.</span> <span class="toc-text">试题2</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E5%BA%93%E8%AE%BE%E8%AE%A1"><span class="toc-number">20.</span> <span class="toc-text">数据库设计</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%9B%9E%E7%AD%94%E6%A8%A1%E6%9D%BF"><span class="toc-number">20.1.</span> <span class="toc-text">回答模板</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E4%B8%BB%E9%94%AE%E5%A4%96%E9%94%AE%EF%BC%9A%E6%8A%8A1%E6%96%B9%E5%86%99%E5%85%A5%E5%A4%9A%E6%96%B9%EF%BC%8C"><span class="toc-number">21.</span> <span class="toc-text">主键外键：把1方写入多方，</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E5%BA%93%E8%AE%BE%E8%AE%A1%E8%BF%87%E7%A8%8B-1"><span class="toc-number">21.1.</span> <span class="toc-text">数据库设计过程</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#E-R%E6%A8%A1%E5%9E%8B-1"><span class="toc-number">21.2.</span> <span class="toc-text">E-R模型</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%AE%9E%E4%BD%93%E9%97%B4%E8%81%94%E7%B3%BB%E7%B1%BB%E5%9E%8B"><span class="toc-number">21.2.1.</span> <span class="toc-text">实体间联系类型</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AE%9E%E4%BD%93"><span class="toc-number">21.3.</span> <span class="toc-text">实体</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%B1%9E%E6%80%A7"><span class="toc-number">21.4.</span> <span class="toc-text">属性</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E5%9B%BE%E5%90%91%E5%85%B3%E7%B3%BB%E6%A8%A1%E5%9E%8B%E7%9A%84%E8%BD%AC%E6%8D%A2"><span class="toc-number">21.4.1.</span> <span class="toc-text">图向关系模型的转换</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%AD%94%E9%A2%98%E6%8A%80%E5%B7%A7-1"><span class="toc-number">21.5.</span> <span class="toc-text">答题技巧</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#UML%E5%BB%BA%E6%A8%A1"><span class="toc-number">22.</span> <span class="toc-text">UML建模</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%94%A8%E4%BE%8B%E5%9B%BE"><span class="toc-number">22.1.</span> <span class="toc-text">用例图</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%B1%BB%E5%9B%BE%E4%B8%8E%E5%AF%B9%E8%B1%A1"><span class="toc-number">22.2.</span> <span class="toc-text">类图与对象</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%A1%AB%E7%B1%BB%E5%90%8D%EF%BC%8C%E6%96%B9%E6%B3%95%E5%90%8D%E3%80%81%E5%B1%9E%E6%80%A7%E5%90%8D"><span class="toc-number">22.3.</span> <span class="toc-text">填类名，方法名、属性名</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%A1%AB%E5%A4%9A%E9%87%8D%E5%BA%A6"><span class="toc-number">22.4.</span> <span class="toc-text">填多重度</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%A1%AB%E5%85%B3%E7%B3%BB"><span class="toc-number">22.5.</span> <span class="toc-text">填关系</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%A1%BA%E5%BA%8F%E5%9B%BE"><span class="toc-number">22.6.</span> <span class="toc-text">顺序图</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%B4%BB%E5%8A%A8%E5%9B%BE"><span class="toc-number">22.7.</span> <span class="toc-text">活动图</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E7%8A%B6%E6%80%81%E5%9B%BE"><span class="toc-number">22.8.</span> <span class="toc-text">状态图</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E9%80%9A%E4%BF%A1%E5%9B%BE"><span class="toc-number">22.9.</span> <span class="toc-text">通信图</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%A1%88%E4%BE%8B%E5%88%86%E6%9E%901"><span class="toc-number">22.10.</span> <span class="toc-text">案例分析1</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E6%A1%88%E4%BE%8B%E5%88%86%E6%9E%902"><span class="toc-number">22.11.</span> <span class="toc-text">案例分析2</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E5%8F%8A%E7%AE%97%E6%B3%95%E5%BA%94%E7%94%A8"><span class="toc-number">23.</span> <span class="toc-text">数据结构及算法应用</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%88%86%E6%B2%BB%E6%B3%95"><span class="toc-number">23.1.</span> <span class="toc-text">分治法</span></a><ol class="toc-child"><li class="toc-item toc-level-3"><a class="toc-link" href="#%E9%80%92%E5%BD%92%E6%8A%80%E6%9C%AF"><span class="toc-number">23.1.1.</span> <span class="toc-text">递归技术</span></a></li><li class="toc-item toc-level-3"><a class="toc-link" href="#%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE-1"><span class="toc-number">23.1.2.</span> <span class="toc-text">二分查找</span></a></li></ol></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%9B%9E%E6%BA%AF%E6%B3%95"><span class="toc-number">23.2.</span> <span class="toc-text">回溯法</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%B4%AA%E5%BF%83%E6%B3%95"><span class="toc-number">23.3.</span> <span class="toc-text">贪心法</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E6%B3%95"><span class="toc-number">23.4.</span> <span class="toc-text">动态规划法</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AF%95%E9%A2%981-1"><span class="toc-number">23.5.</span> <span class="toc-text">试题1</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E8%AF%95%E9%A2%982-1"><span class="toc-number">23.6.</span> <span class="toc-text">试题2</span></a></li></ol></li><li class="toc-item toc-level-1"><a class="toc-link" href="#%E9%9D%A2%E5%90%91%E5%AF%B9%E8%B1%A1%E7%A8%8B%E5%BA%8F%E8%AE%BE%E8%AE%A1"><span class="toc-number">24.</span> <span class="toc-text">面向对象程序设计</span></a><ol class="toc-child"><li class="toc-item toc-level-2"><a class="toc-link" href="#C"><span class="toc-number">24.1.</span> <span class="toc-text">C++</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#JAVA"><span class="toc-number">24.2.</span> <span class="toc-text">JAVA</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AE%9E%E4%BE%8B1"><span class="toc-number">24.3.</span> <span class="toc-text">实例1</span></a></li><li class="toc-item toc-level-2"><a class="toc-link" href="#%E5%AE%9E%E4%BE%8B2"><span class="toc-number">24.4.</span> <span class="toc-text">实例2</span></a></li></ol></li></ol></div></div><div class="card-widget card-recent-post"><div class="item-headline"><i class="fas fa-history"></i><span>最新文章</span></div><div class="aside-list"><div class="aside-list-item"><a class="thumbnail" href="/2023/07/06/Java%E5%85%AB%E8%82%A1%E6%96%87/" title="Java八股文"><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog/images/javaall.gif" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="Java八股文"/></a><div class="content"><a class="title" href="/2023/07/06/Java%E5%85%AB%E8%82%A1%E6%96%87/" title="Java八股文">Java八股文</a><time datetime="2023-07-06T14:22:22.000Z" title="发表于 2023-07-06 22:22:22">2023-07-06</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/2023/07/06/%E5%90%8E%E7%AB%AF%E8%A7%84%E5%88%92/" title="Java后端"><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog/images/javahd.jpeg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="Java后端"/></a><div class="content"><a class="title" href="/2023/07/06/%E5%90%8E%E7%AB%AF%E8%A7%84%E5%88%92/" title="Java后端">Java后端</a><time datetime="2023-07-06T14:22:22.000Z" title="发表于 2023-07-06 22:22:22">2023-07-06</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/2023/06/02/MybatisPlus/" title="MybatisPlus"><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog/images/mybatisplus.svg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="MybatisPlus"/></a><div class="content"><a class="title" href="/2023/06/02/MybatisPlus/" title="MybatisPlus">MybatisPlus</a><time datetime="2023-06-02T14:22:22.000Z" title="发表于 2023-06-02 22:22:22">2023-06-02</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/2023/05/05/Linux/" title="Linux"><img src= "" data-lazy-src="/img/loading.gif" data-original="https://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog/images/Linux.jpg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="Linux"/></a><div class="content"><a class="title" href="/2023/05/05/Linux/" title="Linux">Linux</a><time datetime="2023-05-05T14:22:22.000Z" title="发表于 2023-05-05 22:22:22">2023-05-05</time></div></div><div class="aside-list-item"><a class="thumbnail" href="/2023/05/05/Redis/" title="Redis"><img src= "" data-lazy-src="/img/loading.gif" data-original="ttps://chen-1317386995.cos.ap-guangzhou.myqcloud.com/Blog/images/Redis.jpeg" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="Redis"/></a><div class="content"><a class="title" href="/2023/05/05/Redis/" title="Redis">Redis</a><time datetime="2023-05-05T14:22:22.000Z" title="发表于 2023-05-05 22:22:22">2023-05-05</time></div></div></div></div></div></div></main><footer id="footer"><div id="footer-wrap"><div class="copyright">&copy;2020 - 2023 By 辰</div><div class="framework-info"><a target="_blank" rel="noopener" href="https://beian.miit.gov.cn">粤ICP备2023096650号</a><span class="footer-separator">|</span><a target="_blank" rel="noopener" href="http://hchen.cloud">hchen.cloud</a></div></div></footer></div><div id="rightside"><div id="rightside-config-hide"><button id="readmode" type="button" title="阅读模式"><i class="fas fa-book-open"></i></button><button id="darkmode" type="button" title="浅色和深色模式转换"><i class="fas fa-adjust"></i></button><button id="hide-aside-btn" type="button" title="单栏和双栏切换"><i class="fas fa-arrows-alt-h"></i></button></div><div id="rightside-config-show"><button id="rightside_config" type="button" title="设置"><i class="fas fa-cog fa-spin"></i></button><button class="close" id="mobile-toc-button" type="button" title="目录"><i class="fas fa-list-ul"></i></button><button id="go-up" type="button" title="回到顶部"><span class="scroll-percent"></span><i class="fas fa-arrow-up"></i></button></div></div><div><script src="/js/utils.js"></script><script src="/js/main.js"></script><script src="https://cdn.jsdelivr.net/npm/@fancyapps/ui/dist/fancybox/fancybox.umd.min.js"></script><script src="https://cdn.jsdelivr.net/npm/vanilla-lazyload/dist/lazyload.iife.min.js"></script><div class="js-pjax"></div><canvas class="fireworks" mobile="false"></canvas><script src="https://cdn.jsdelivr.net/npm/butterfly-extsrc/dist/fireworks.min.js"></script><script defer="defer" id="fluttering_ribbon" mobile="false" src="https://cdn.jsdelivr.net/npm/butterfly-extsrc/dist/canvas-fluttering-ribbon.min.js"></script><script async data-pjax src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script><div id="local-search"><div class="search-dialog"><nav class="search-nav"><span class="search-dialog-title">搜索</span><span id="loading-status"></span><button class="search-close-button"><i class="fas fa-times"></i></button></nav><div class="is-center" id="loading-database"><i class="fas fa-spinner fa-pulse"></i><span>  数据库加载中</span></div><div class="search-wrap"><div id="local-search-input"><div class="local-search-box"><input class="local-search-box--input" placeholder="搜索文章" type="text"/></div></div><hr/><div class="no-result" id="local-search-results"></div><div id="local-search-stats-wrap"></div></div></div><div id="search-mask"></div><script src="/js/search/local-search.js"></script></div></div>
        <style>
            [bg-lazy] {
                background-image: none !important;
                background-color: #eee !important;
            }
        </style>
        <script>
            window.imageLazyLoadSetting = {
                isSPA: false,
                preloadRatio: 1,
                processImages: null,
            };
        </script><script>window.addEventListener("load",function(){var t=/\.(gif|jpg|jpeg|tiff|png)$/i,r=/^data:image\/[a-z]+;base64,/;Array.prototype.slice.call(document.querySelectorAll("img[data-original]")).forEach(function(a){var e=a.parentNode;"A"===e.tagName&&(e.href.match(t)||e.href.match(r))&&(e.href=a.dataset.original)})});</script><script>!function(r){r.imageLazyLoadSetting.processImages=t;var e=r.imageLazyLoadSetting.isSPA,n=r.imageLazyLoadSetting.preloadRatio||1,c=a();function a(){var t=Array.prototype.slice.call(document.querySelectorAll("img[data-original]")),e=Array.prototype.slice.call(document.querySelectorAll("[bg-lazy]"));return t.concat(e)}function t(){e&&(c=a());for(var t,o=0;o<c.length;o++)0<=(t=(t=c[o]).getBoundingClientRect()).bottom&&0<=t.left&&t.top<=(r.innerHeight*n||document.documentElement.clientHeight*n)&&function(){var t,e,n,a,i=c[o];e=function(){c=c.filter(function(t){return i!==t}),r.imageLazyLoadSetting.onImageLoaded&&r.imageLazyLoadSetting.onImageLoaded(i)},(t=i).hasAttribute("bg-lazy")?(t.removeAttribute("bg-lazy"),e&&e()):(n=new Image,a=t.getAttribute("data-original"),n.onload=function(){t.src=a,t.removeAttribute("data-original"),e&&e()},t.src!==a&&(n.src=a))}()}function i(){clearTimeout(t.tId),t.tId=setTimeout(t,500)}t(),document.addEventListener("scroll",i),r.addEventListener("resize",i),r.addEventListener("orientationchange",i)}(this);</script></body></html>